Sciweavers

1531 search results - page 238 / 307
» Learning probabilistic models of the Web
Sort
View
ICDAR
2007
IEEE
16 years 15 days ago
Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation
Using a lexicon can often improve character recognition under challenging conditions, such as poor image quality or unusual fonts. We propose a flexible probabilistic model for c...
Jerod J. Weinman, Erik G. Learned-Miller, Allen R....
ISI
2007
Springer
16 years 10 days ago
A Combinatorial Approach to Measuring Anonymity
— In this paper we define a new metric for quantifying the degree of anonymity collectively afforded to users of an anonymous communication system. We show how our metric, based...
Matthew Edman, Fikret Sivrikaya, Bülent Yener
ICPR
2010
IEEE
15 years 12 months ago
Sparse Coding of Linear Dynamical Systems with an Application to Dynamic Texture Recognition
Given a sequence of observable features of a linear dynamical system (LDS), we propose the problem of finding a representation of the LDS which is sparse in terms of a given dict...
Bernard Ghanem, Narendra Ahuja
ICNP
2005
IEEE
15 years 11 months ago
Expected Convergence Properties of BGP
Border Gateway Protocol (BGP) is the de facto standard used for interdomain routing. Since packet forwarding may not be possible until stable routes are learned, it is not only cr...
Ramesh Viswanathan, Krishan K. Sabnani, Robert J. ...
IJCNLP
2005
Springer
15 years 11 months ago
Chunking Using Conditional Random Fields in Korean Texts
We present a method of chunking in Korean texts using conditional random fields (CRFs), a recently introduced probabilistic model for labeling and segmenting sequence of data. In a...
Yong-Hun Lee, Mi-Young Kim, Jong-Hyeok Lee