Sciweavers

865 search results - page 77 / 173
» Random graph models for the web graph
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
CVPR
2008
IEEE
16 years 8 months ago
Max Margin AND/OR Graph learning for parsing the human body
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
Long Zhu, Yuanhao Chen, Yifei Lu, Chenxi Lin, Alan...
ICML
2009
IEEE
16 years 7 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
SC
2009
ACM
16 years 1 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan
WEBI
2007
Springer
16 years 11 days ago
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B...