Sciweavers

1082 search results - page 159 / 217
» Approximation Algorithms for Spreading Points
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 9 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
14 years 9 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
MM
2009
ACM
118views Multimedia» more  MM 2009»
14 years 3 months ago
Vocabulary-based hashing for image search
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...
Yingyu Liang, Jianmin Li, Bo Zhang
CGF
2008
135views more  CGF 2008»
13 years 9 months ago
Streaming Surface Reconstruction Using Wavelets
We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution rep...
Josiah Manson, G. Petrova, Scott Schaefer
TKDE
2008
162views more  TKDE 2008»
13 years 9 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...