409 search results - page 63 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
NCA
2009
IEEE
15 years 4 months ago
2009
IEEE
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
107
click to vote
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
STOC
2010
ACM
15 years 2 months 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...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...