1389 search results - page 101 / 278 » Improved Approximation Algorithms for Label Cover Problems |
126
click to vote
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
167
click to vote
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
116
click to vote
ICB
2009
Springer
15 years 9 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
144
click to vote
CLUSTER
2001
IEEE
15 years 6 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
126
click to vote
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...