Sciweavers

1629 search results - page 134 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
82
Voted
ICDAR
2009
IEEE
14 years 7 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
MICCAI
2008
Springer
15 years 11 months ago
Automatic Image Analysis of Histopathology Specimens Using Concave Vertex Graph
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...
Lin Yang, Oncel Tuzel, Peter Meer, David J. For...
EWCBR
2004
Springer
15 years 3 months ago
Investigating Graphs in Textual Case-Based Reasoning
Textual case-based reasoning (TCBR) provides the ability to reason with domain-specific knowledge when experiences exist in text. Ideally, we would like to find an inexpensive way ...
Colleen Cunningham, Rosina Weber, Jason M. Proctor...
ICPR
2006
IEEE
15 years 11 months ago
Multiple Objects Tracking with Multiple Hypotheses Graph Representation
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...
Alex Yong Sang Chia, Liyuan Li, Weimin Huang
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 2 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...