2711 search results - page 200 / 543 » Mapping sequences by parts |
167
click to vote
ISVC
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, we propose a method for obtaining a textured billboards representation of a static scene, given a sequence of calibrated video images. Each billboard is a textured a...
139
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
149
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
173
click to vote
CAIP
1997
Springer
15 years 10 months ago
1997
Springer
An algorithm for optical ow estimation is presented for the case of discrete-time motion of an uncalibrated camera through a rigid world. Unlike traditional optical ow approaches t...
164
click to vote
COSIT
1997
Springer
15 years 10 months ago
1997
Springer
As described here, pragmatic navigation attempts to harness simple facts about a two-dimensional environment to facilitate travel through it without an explicit map. It relies upo...