Sciweavers

1427 search results - page 160 / 286
» Markov Random Field Modeling in Computer Vision
Sort
View
123
Voted
EMNLP
2007
15 years 5 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
136
Voted
ICDCS
2007
IEEE
15 years 10 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta
126
Voted
CVPR
2007
IEEE
16 years 5 months ago
Compositional Boosting for Computing Hierarchical Image Structures
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...
Tianfu Wu, Gui-Song Xia, Song Chun Zhu
131
Voted
ISTCS
1993
Springer
15 years 7 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
145
Voted
ICPR
2004
IEEE
16 years 4 months ago
Rejection Strategies for Offline Handwritten Sentence Recognition
This paper investigates three different rejection strategies for offline handwritten sentence recognition. The rejection strategies are implemented as a postprocessing step of a H...
Horst Bunke, Matthias Zimmermann, Roman Bertolami