Sciweavers

5580 search results - page 242 / 1116
» Randomized priority algorithms
Sort
View
177
Voted
EMNLP
2009
15 years 4 months ago
On the Use of Virtual Evidence in Conditional Random Fields
Virtual evidence (VE), first introduced by (Pearl, 1988), provides a convenient way of incorporating prior knowledge into Bayesian networks. This work generalizes the use of VE to...
Xiao Li
IJAMCIGI
2010
94views more  IJAMCIGI 2010»
15 years 1 months ago
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover
CVPR
1998
IEEE
16 years 8 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
CVPR
2007
IEEE
16 years 8 months ago
Learning Conditional Random Fields for Stereo
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
Daniel Scharstein, Chris Pal
ICIP
2008
IEEE
16 years 8 months ago
Nonconvex compressive sensing and reconstruction of gradient-sparse images: Random vs. tomographic Fourier sampling
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
Rick Chartrand