2434 search results - page 227 / 487 » Algorithmic Randomness of Closed Sets |
131
click to vote
CSCLP
2004
Springer
15 years 9 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
115
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
136
click to vote
AAAI
2007
15 years 6 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
139
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
For large scale automatic semantic video characterization, it is necessary to learn and model a large number of semantic concepts. But a major obstacle to this is the insufficienc...
150
click to vote
HPCA
2000
IEEE
15 years 8 months ago
2000
IEEE
Main memory accesses continue to be a significant bottleneck for applications whose working sets do not fit in second-level caches. With the trend of greater associativity in seco...