Sciweavers

2570 search results - page 156 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Joint disparity and optical flow by correspondence growing
The scene flow in binocular stereo setup is estimated using a seed growing algorithm. A pair of calibrated and synchronized cameras observe a scene and output a sequence of image...
Jan Cech, Radu Horaud
139
Voted
DAGSTUHL
2003
15 years 4 months ago
Reliable Distance and Intersection Computation Using Finite Precision Geometry
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
Katja Bühler, Eva Dyllong, Wolfram Luther
144
Voted
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 7 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
CVPR
2008
IEEE
16 years 5 months ago
Fast and robust numerical solutions to minimal problems for cameras with radial distortion
A number of minimal problems of structure from motion for cameras with radial distortion have recently been studied and solved in some cases. These problems are known to be numeri...
Karl Åström, Klas Josephson, Martin Byr...
122
Voted
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 9 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu