Sciweavers

8431 search results - page 4 / 1687
» Algorithmically Independent Sequences
Sort
View
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
14 years 10 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
ICCV
2007
IEEE
14 years 3 months ago
Simultaneous Segmentation and 3D Reconstruction of Monocular Image Sequences
When trying to extract 3D scene information and camera motion from an image sequence alone, it is often necessary to cope with independently moving objects. Recent research has un...
Kemal Egemen Ozden, Konrad Schindler, Luc J. Van G...
COMPGEOM
2006
ACM
14 years 3 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine
ICPR
2010
IEEE
14 years 28 days ago
Spatial Representation for Efficient Sequence Classification
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
Pavel Kuksa, Vladimir Pavlovic
ECCV
1994
Springer
14 years 11 months ago
Recursive Affine Structure and Motion from Image Sequences
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
Philip F. McLauchlan, Ian D. Reid, David W. Murray