#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1982

2016

- This year (0)
- Last five years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Laura Monroe, Joanne Wendelberger, Sarah Ellen Michalak
- High Performance Graphics
- 2011

We implement here a fast and memory-sparing probabilistic top <i>k</i> selection algorithm on the GPU. The algorithm proceeds via an iterative probabilistic guess-and-check process on pivots for a three-way partition. When the guess is correct, the problem is reduced to selection on a much smaller set. This probabilistic algorithm always gives a correct… (More)

- Laura Monroe
- 2007

In this paper, we provide a simpler proof of a previously known result about greedily generated binary codes. We consider the mapping g: V n ⇒ V m , which sends binary vectors to their g-values obtained from a Bordering. We show that g is a homomorphism via a proof by induction on g-values. The proof depends on a previous result that the set of vectors… (More)

- Lewis P. Rowland, Robert P. Lisak, +21 authors Harry Ramaley
- 2011

30 Avidan welcomed everyone and asked meeting attendees to introduce themselves.

- David Pugmire, Laura Monroe, Carolyn Connor Davenport, Andrew DuBois, David DuBois, Stephen W. Poole
- IEEE Transactions on Visualization and Computer…
- 2007

This paper describes the first use of a network processing unit (NPU) to perform hardware-based image composition in a distributed rendering system. The image composition step is a notorious bottleneck in a clustered rendering system. Furthermore, image compositing algorithms do not necessarily scale as data size and number of nodes increase. Previous… (More)

- Laura Monroe
- Des. Codes Cryptography
- 1996

In this paper, we examine greedily generated self orthogonal codes. We show that they are linear, and discuss several properties which they possess. We also look at specific examples of these codes.

- Nathan DeBardeleben, Sean Blanchard, +4 authors Cornell Wright
- Euro-Par Workshops
- 2013

- Laura Monroe, Vera Pless, N J H J A Conway, Sloane, N J A Sloane
- 1995

We get a Bordering of all binary n-tuples V n by choosing an ordered basis {y 1 ,...,y n } of V n and ordering the n-tuples as follows: 0, y 1 , y 2 , y 2 +y 1 , y 3 , y 3 +y 1 , y 3 +y 2 , y 3 +y 2 +y 1 , y 4 ,... Given a minimum distance d, choose a set of vectors S with the zero vector first, then go through the vectors in their Bordering and choose the… (More)

- A White, James Ahrens, +11 authors Kwan-Liu Ma
- 2011

Scope The scope of our working group is scientific visualization and data analysis. Scientific visualization refers to the process of transforming scientific simulation and experimental data into images to facilitate visual understanding. Data analysis refers to the process of transforming data into an information-rich form via mathematical or computational… (More)

- Laura M Monroe, Linda M Kinney, Mark D Weist, Denise Spriggs Dafeamekpor, Joyce Dantzler, Matthew W Reynolds
- Journal of interpersonal violence
- 2005

A statewide assessment was conducted of assaults, experiences, needs, and recommendations of 125 adult victims receiving care at 19 sexual assault centers (SACs) in the State of Maryland. More than one half of the victims (55.6%) waited years before disclosing, with delays in reporting especially likely if the assault was perpetrated by a family member (the… (More)

Los Alamos National Laboratory (LANL) has deployed a 43-megapixel multi-panel immersive environment, La Cueva Grande (LCG), to be used in visualizing the terabytes of data produced by simulations. This paper briefly discusses some of the technical challenges encountered and overcome during the deployment of a 43-million pixel immersive visualization… (More)