1120 search results - page 209 / 224 » Eager Markov Chains |
111
click to vote
KDD
2004
ACM
16 years 5 days ago
2004
ACM
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
RECOMB
2004
Springer
16 years 2 days ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
165
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...