Sciweavers

511 search results - page 80 / 103
» TSP with bounded metrics
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
ICML
2006
IEEE
14 years 5 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
APPROX
2009
Springer
96views Algorithms» more  APPROX 2009»
14 years 3 months ago
On the Optimality of Gluing over Scales
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Alexander Jaffe, James R. Lee, Mohammad Moharrami
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 2 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
14 years 2 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...