Sciweavers

3110 search results - page 566 / 622
» On the initialization of the DNMF algorithm
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 8 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 7 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
DLS
2005
176views Languages» more  DLS 2005»
15 years 6 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers
CIVR
2008
Springer
207views Image Analysis» more  CIVR 2008»
15 years 6 months ago
Accumulated motion energy fields estimation and representation for semantic event detection
In this paper, a motion-based approach for detecting highlevel semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be direc...
Georgios Th. Papadopoulos, Vasileios Mezaris, Ioan...
COLT
2008
Springer
15 years 6 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal