Sciweavers

180 search results - page 32 / 36
» Relational Graph Labelling Using Learning Techniques and Mar...
Sort
View
WACV
2002
IEEE
15 years 2 months ago
Range Synthesis for 3D Environment Modeling
In this paper a range synthesis algorithm is proposed as an initial solution to the problem of 3D environment modeling from sparse data. We develop a statistical learning method f...
Luz Abril Torres-Méndez, Gregory Dudek
ICPR
2000
IEEE
15 years 1 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
ACCV
2010
Springer
14 years 4 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 9 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot