Sciweavers

582 search results - page 41 / 117
» Distance Measures for Well-Distributed Sets
Sort
View
SBACPAD
2005
IEEE
176views Hardware» more  SBACPAD 2005»
14 years 2 months ago
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
14 years 2 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...
ICPR
2010
IEEE
13 years 6 months ago
3D Vertebral Body Segmentation Using Shape Based Graph Cuts
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we propose a novel 3D shape based met...
Melih S. Aslan, Asem M. Ali, Aly A. Farag, Ham M. ...
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 9 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro