3875 search results - page 136 / 775 » Approximation algorithms for the 0-extension problem |
156
click to vote
CLUSTER
2001
IEEE
15 years 8 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 ...
147
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
103
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
161
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
147
click to vote
CCE
2004
15 years 4 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...