Sciweavers

263 search results - page 34 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Modeling and generating complex motion blur for real-time tracking
This article addresses the problem of real-time visual tracking in presence of complex motion blur. Previous authors have observed that efficient tracking can be obtained by match...
Christopher Mei, Ian Reid
ICFP
2002
ACM
15 years 11 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
BMCBI
2006
141views more  BMCBI 2006»
14 years 11 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
IPL
2006
89views more  IPL 2006»
14 years 11 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
JMLR
2008
94views more  JMLR 2008»
14 years 11 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff