Sciweavers

4212 search results - page 317 / 843
» On Compressible Pairings and Their Computation
Sort
View
ECCV
2002
Springer
16 years 8 months ago
Structure and Motion for Dynamic Scenes - The Case of Points Moving in Planes
We consider dynamic scenes consisting of moving points whose motion is constrained to happen in one of a pencil of planes. This is for example the case when rigid objects move ind...
Peter F. Sturm
ICPR
2004
IEEE
16 years 8 months ago
Finding Region Correspondences for Wide Baseline Stereo
This study addresses the problem of finding correspondences for wide baseline stereo. Texture has traditionally been utilised as a single-image cue for 3D shape reconstruction (sh...
Dmitry Chetverikov, Zoltán Megyesi, Zsolt J...
FOCS
2007
IEEE
16 years 1 months ago
Buy-at-Bulk Network Design with Protection
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce...
CVPR
2010
IEEE
16 years 13 days ago
Line Matching Leveraged By Point Correspondences
A novel method for line matching is proposed. The basic idea is to use tentative point correspondences, which can be easily obtained by keypoint matching methods, to significantly...
Bin Fan, Fuchao Wu, Zhanyi Hu
ISAAC
2004
Springer
114views Algorithms» more  ISAAC 2004»
16 years 5 days ago
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA mole...
Markus Bauer, Gunnar W. Klau