1161 search results - page 93 / 233 » Approximation schemes for clustering problems |
128
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
136
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
152
Voted
JMLR
2008
15 years 3 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
162
Voted
IJCV
2011
14 years 10 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
118
Voted
DCC
2009
IEEE
16 years 4 months ago
2009
IEEE
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...