6365 search results - page 13 / 1273 » Fast Local Computation Algorithms |
77
Voted
EMMCVPR
2003
Springer
15 years 3 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...