13603 search results - page 2421 / 2721 » On the Complexity of Computing Treelength |
181
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
181
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
173
click to vote
PRL
2006
15 years 6 months ago
2006
Approaches analyzing local characteristics of an image prevail in image restoration. However, they are less effective in cases of restoring images degraded by large size point spr...
175
click to vote
SIAMIS
2008
15 years 6 months ago
2008
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
165
click to vote
IJCGA
2007
15 years 6 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...