Sciweavers

9209 search results - page 48 / 1842
» Data Space Randomization
Sort
View
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 4 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
MA
2010
Springer
206views Communications» more  MA 2010»
15 years 18 days ago
Quantization and clustering with Bregman divergences
 This paper deals with the quantization problem of a random variable X taking values in a separable and reexive Banach space, and with the related question of clustering independ...
Aurélie Fischer
155
Voted
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
15 years 3 days ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík