3875 search results - page 491 / 775 » Approximation algorithms for the 0-extension problem |
247
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
181
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
128
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
172
click to vote
ISAAC
2007
Springer
16 years 24 days ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
173
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...