1120 search results - page 34 / 224 » Eager Markov Chains |
EMNLP
2006
15 years 1 months ago
2006
We present an investigation of recently proposed character and word sequence kernels for the task of authorship attribution based on relatively short texts. Performance is compare...
100
click to vote
NIPS
2000
15 years 1 months ago
2000
When trying to recover 3D structure from a set of images, the most di cult problem is establishing the correspondence between the measurements. Most existing approaches assume tha...
109
click to vote
HPDC
2010
IEEE
15 years 27 days ago
2010
IEEE
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
ALMOB
2006
14 years 12 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...