Sciweavers

4560 search results - page 64 / 912
» Finding Data in the Neighborhood
Sort
View
SENSYS
2003
ACM
14 years 1 months ago
Taming the underlying challenges of reliable multihop routing in sensor networks
The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic ...
Alec Woo, Terence Tong, David E. Culler
CVPR
2000
IEEE
13 years 11 months ago
Adaptive Metric nearest Neighbor Classification
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...
Carlotta Domeniconi, Dimitrios Gunopulos, Jing Pen...
CG
2007
Springer
13 years 7 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
JCO
2007
123views more  JCO 2007»
13 years 7 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
CGF
2011
13 years 2 months ago
A Parallel SPH Implementation on Multi-Core CPUs
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
Markus Ihmsen, Nadir Akinci, Markus Becker, Matthi...