Sciweavers

601 search results - page 36 / 121
» Measurable sets with excluded distances
Sort
View
TKDE
2011
332views more  TKDE 2011»
13 years 4 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
ORL
2008
99views more  ORL 2008»
13 years 9 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 10 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer
SGP
2007
14 years 9 days ago
Constraint-based fairing of surface meshes
We propose a constraint-based method for the fairing of surface meshes. The main feature of our approach is that the resulting smoothed surface remains within a prescribed distanc...
Klaus Hildebrandt, Konrad Polthier