4377 search results - page 364 / 876 » Mass problems and randomness |
164
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a novel stochastic, adaptive strategy for tracking multiple people in a large network of video cameras. Similarities between features (appearance and biometrics) observ...
171
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
188
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
168
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
177
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...