2342 search results - page 58 / 469 » Sublinear geometric algorithms |
127
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
140
click to vote
JACM
2006
15 years 2 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
138
click to vote
SIAMJO
2010
14 years 9 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
110
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
142
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...