Sciweavers

1427 search results - page 160 / 286
» Markov Random Field Models in Computer Vision
Sort
View
EMNLP
2007
15 years 3 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
ICDCS
2007
IEEE
15 years 8 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
CVPR
2007
IEEE
16 years 3 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
ISTCS
1993
Springer
15 years 5 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
ICPR
2004
IEEE
16 years 2 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