Sciweavers

739 search results - page 86 / 148
» Sorting Algorithms
Sort
View
73
Voted
TVCG
2010
141views more  TVCG 2010»
14 years 9 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
EGH
2007
Springer
15 years 5 months ago
Scan primitives for GPU computing
The scan primitives are powerful, general-purpose data-parallel primitives that are building blocks for a broad range of applications. We describe GPU implementations of these pri...
Shubhabrata Sengupta, Mark Harris, Yao Zhang, John...
63
Voted
ISCAS
2005
IEEE
111views Hardware» more  ISCAS 2005»
15 years 4 months ago
Spectral shaping of timing mismatches in time-interleaved analog-to-digital converters
— We introduce spectral shaping of timing mismatches in time-interleaved analog-to-digital converters (TIADCs). We show how to reorder the channel ADC sequence in order to achiev...
Christian Vogel, Dieter Draxelmayr, Gernot Kubin
63
Voted
SC
2000
ACM
15 years 3 months ago
Distributed Rendering for Scalable Displays
We describe a novel distributed graphics system that allows an application to render to a large tiled display. Our system, called WireGL, uses a cluster of off-the-shelf PCs conne...
Greg Humphreys, Ian Buck, Matthew Eldridge, Pat Ha...
IPPS
1999
IEEE
15 years 3 months ago
BRISK: A Portable and Flexible Distributed Instrumentation System
Researchers and practitioners in the area of parallel and distributed computing have been lacking a portable, flexible and robust distributed instrumentation system. We present th...
Aleksandar M. Bakic, Matt W. Mutka, Diane T. Rover