Sciweavers

124 search results - page 12 / 25
» Efficient Algorithms for Conditional Independence Inference
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
PAMPAS: Real-Valued Graphical Models for Computer Vision
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
Michael Isard
JCST
2006
65views more  JCST 2006»
13 years 7 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
ECCV
2004
Springer
14 years 9 months ago
Scene and Motion Reconstruction from Defocused and Motion-Blurred Images via Anisotropic Diffusion
We propose a solution to the problem of inferring the depth map, radiance and motion of a scene from a collection of motion-blurred and defocused images. We model motion-blur and d...
Paolo Favaro, Martin Burger, Stefano Soatto
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
14 years 9 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
SIGMETRICS
2002
ACM
103views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Network tomography on general topologies
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...
Tian Bu, Nick G. Duffield, Francesco Lo Presti, Do...