Sciweavers

2434 search results - page 227 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CSCLP
2004
Springer
15 years 12 months ago
Dynamic Distributed BackJumping
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 ...
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
16 years 6 months ago
Near-optimal sparse fourier representations via sampling
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...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
AAAI
2007
15 years 8 months ago
Restart Schedules for Ensembles of Problem Instances
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...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
CVPR
2005
IEEE
16 years 8 months ago
Semi-Supervised Cross Feature Learning for Semantic Concept Detection in Videos
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...
Rong Yan, Milind R. Naphade
HPCA
2000
IEEE
15 years 11 months ago
Modified LRU Policies for Improving Second-Level Cache Behavior
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...
Wayne A. Wong, Jean-Loup Baer