5595 search results - page 837 / 1119 » Approximation Algorithms for Clustering Problems |
174
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper, we discuss how to apply the rate distortion technique to select the optimal mode in the scalable coding. Firstly, we analyze this problem from a general scalable mo...
190
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
151
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
147
click to vote
COCOON
2007
Springer
16 years 26 days ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
151
click to vote
ISAAC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...