5595 search results - page 337 / 1119 » Approximation Algorithms for Clustering Problems |
157
click to vote
SIGIR
2005
ACM
16 years 8 days ago
2005
ACM
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
168
click to vote
TACAS
2005
Springer
16 years 6 days ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
239
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
168
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
171
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...