Sciweavers

649 search results - page 94 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
USS
2008
13 years 10 months ago
On Auditing Elections When Precincts Have Different Sizes
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest
PERCOM
2006
ACM
14 years 7 months ago
Localized Sensor Area Coverage with Low Communication Overhead
We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors...
Antoine Gallais, Jean Carle, David Simplot-Ryl, Iv...
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
3DIM
2007
IEEE
14 years 1 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
CIKM
2006
Springer
13 years 9 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen