Sciweavers

2799 search results - page 383 / 560
» Comparing Point Clouds
Sort
View
138
Voted
GD
2005
Springer
15 years 10 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
IPMI
2005
Springer
15 years 10 months ago
ZHARP: Three-Dimensional Motion Tracking from a Single Image Plane
Three-dimensional imaging and quantification of myocardial function are essential steps in the evaluation of cardiac disease. We propose a tagged magnetic resonance imaging method...
Khaled Z. Abd-Elmoniem, Matthias Stuber, Nael F. O...
IPSN
2005
Springer
15 years 10 months ago
Detecting cuts in sensor networks
— We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. ...
Nisheeth Shrivastava, Subhash Suri, Csaba D. T&oac...
159
Voted
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 10 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
146
Voted
MICAI
2005
Springer
15 years 10 months ago
Hybrid Particle Swarm - Evolutionary Algorithm for Search and Optimization
Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have b...
Crina Grosan, Ajith Abraham, Sangyong Han, Alexand...