Sciweavers

104 search results - page 12 / 21
» An Improved Random Neighborhood Graph Approach
Sort
View
86
Voted
AAAI
2011
13 years 9 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CN
2000
109views more  CN 2000»
14 years 9 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
76
Voted
ICML
2006
IEEE
15 years 10 months ago
Learning high-order MRF priors of color images
In this paper, we use large neighborhood Markov random fields to learn rich prior models of color images. Our approach extends the monochromatic Fields of Experts model (Roth &...
Alex J. Smola, Julian John McAuley, Matthias O. Fr...
TCSV
2002
229views more  TCSV 2002»
14 years 9 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
CVPR
2009
IEEE
16 years 4 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...