Sciweavers

1427 search results - page 136 / 286
» Markov Random Field Modeling in Computer Vision
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 9 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
CVPR
1997
IEEE
14 years 11 months ago
Independent 3D Motion Detection Based on Depth Elimination in Normal Flow Fields
This paper considers a specific problem of visual perception of motion, namely the problem of visual detection of independent 3D motion. Most of the existing techniques for solvin...
Antonis A. Argyros, Stelios C. Orphanoudakis
CVPR
2001
IEEE
14 years 11 months ago
Light Field Rendering for Large-Scale Scenes
In this paper, we present an efficient method to synthesize large-scale scenes, such as broad city landscapes. To date, model based approaches have mainly been adopted for this pu...
Hiroshi Kawasaki, Katsushi Ikeuchi, Masao Sakauchi
ACL
2012
11 years 11 months ago
Learning to Find Translations and Transliterations on the Web
In this paper, we present a new method for learning to finding translations and transliterations on the Web for a given term. The approach involves using a small set of terms and ...
Joseph Z. Chang, Jason S. Chang, Jyh-Shing Roger J...