4843 search results - page 602 / 969 » The Shortcut Problem - Complexity and Approximation |
178
Voted
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
138
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
143
Voted
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenti...
128
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Abstract. Segmentation and blind restoration are both classical problems, that are known to be difficult and have attracted major research efforts. This paper shows that the two pr...
112
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper addresses the problem of superresolution from low resolution spherical images that are not perfectly registered. Such a problem is typically encountered in omnidirectio...