5595 search results - page 361 / 1119 » Approximation Algorithms for Clustering Problems |
297
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper addresses the problem of fully automated
mining of public space video data. A novel Markov Clustering
Topic Model (MCTM) is introduced which builds on
existing Dynami...
203
click to vote
CCGRID
2007
IEEE
15 years 10 months ago
2007
IEEE
Database storage management in clustered storage environments is a manual, time-consuming, and error-prone task. Such management involves regular movement of database objects acro...
187
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
171
click to vote
TCS
2010
15 years 5 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
217
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...