4843 search results - page 367 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
132
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
143
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
149
click to vote
SCALESPACE
2009
Springer
15 years 11 months ago
2009
Springer
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
168
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...