86 search results - page 11 / 18 » Distance between two k-sets and Path-Systems Extendibility |
194
Voted
INTERSPEECH
2010
15 years 6 days ago
2010
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
167
click to vote
UAI
2003
15 years 6 months ago
2003
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
157
click to vote
DAC
1997
ACM
15 years 9 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
167
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
142
click to vote
SPIRE
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...