Sciweavers

5138 search results - page 435 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
DAGM
2010
Springer
15 years 8 months ago
On-Line Multi-view Forests for Tracking
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
Christian Leistner, Martin Godec, Amir Saffari, Ho...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 8 months ago
Evolution of discrete gene regulatory models
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
Afshin Esmaeili, Christian Jacob
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 7 months ago
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
Yakir Reshef, Salil P. Vadhan
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel