Sciweavers

1009 search results - page 133 / 202
» On Indexing Line Segments
Sort
View
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 10 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
ACCV
2010
Springer
13 years 4 months ago
Minimal Representations for Uncertainty and Estimation in Projective Spaces
Abstract. Estimation using homogeneous entities has to cope with obstacles such as singularities of covariance matrices and redundant parametrizations which do not allow an immedia...
Wolfgang Förstner
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 9 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
ECCV
2002
Springer
14 years 10 months ago
Stereo Matching Using Belief Propagation
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
Jian Sun, Heung-Yeung Shum, Nanning Zheng
ICRA
2006
IEEE
119views Robotics» more  ICRA 2006»
14 years 3 months ago
SLAM with Sparse Sensing
— Most work on the simultaneous localization and mapping (SLAM) problem assumes the frequent availability of dense information about the environment such as that provided by a la...
Kristopher R. Beevers, Wesley H. Huang