7006 search results - page 497 / 1402 » Approximation Algorithms |
157
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
The loss of information due to occlusion and other complications has been one of the main bottlenecks in the field of motion estimation. In this paper, we propose a novel motion e...
275
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
176
click to vote
IPL
2010
15 years 4 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
151
click to vote
CPC
2007
15 years 6 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
161
Voted
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...