5595 search results - page 390 / 1119 » Approximation Algorithms for Clustering Problems |
173
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
187
click to vote
KR
2004
Springer
16 years 5 days ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
170
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
183
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
186
click to vote
NIPS
2001
15 years 8 months ago
2001
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...