14165 search results - page 709 / 2833 » The generalized two-server problem |
168
click to vote
CW
2002
IEEE
16 years 12 days ago
2002
IEEE
In this paper, we present a novel fast algorithmfor image retouching. A space-mapping technique is used to transform a missing (or damaged) part of a surface into a different shap...
204
click to vote
STOC
2010
ACM
16 years 8 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
181
click to vote
CPAIOR
2010
Springer
16 years 8 days ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
178
click to vote
CDC
2009
IEEE
16 years 5 days ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
194
click to vote
COMPGEOM
2009
ACM
16 years 4 days ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...