Sciweavers

1332 search results - page 6 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 8 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
SODA
1997
ACM
171views Algorithms» more  SODA 1997»
13 years 8 months ago
A Practical Approximation Algorithm for the LMS Line Estimator
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
David M. Mount, Nathan S. Netanyahu, Kathleen Roma...
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
14 years 7 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
DKE
2008
72views more  DKE 2008»
13 years 7 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon