#### Filter Results:

#### Publication Year

1976

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Organism

Learn More

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)

During the year their insomnia began, chronic insomniacs experienced a greater number of stressful life events compared with previous or subsequent years and compared with good sleepers. In addition, among the life event categories assessed, insomniacs reported a greater number of undesirable events, particularly events related to losses and to ill health.… (More)

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)

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.

- 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)

To determine whether poor sleepers have a unique personality constellation significantly different from that of good sleepers, a sample of 162 emotionally disturbed adolescent poor sleepers was compared to a sample of 153 emotionally disturbed adolescent good sleepers on standardized personality instruments. Poor sleepers were found to have a high incidence… (More)

- A White, James Ahrens, David Rogers, Becky Springmeyer, Eric Brugger, Patricia Crossno +8 others
- 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)

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)