311 search results - page 51 / 63 » Better streaming algorithms for clustering problems |
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
The appearance of non-rigid objects detected and tracked in video streams is highly variable and therefore makes the identification of similar objects very complex. Furthermore, i...
MST
2010
13 years 6 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...