Sciweavers

674 search results - page 73 / 135
» Arguments and Results
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 9 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
ALT
2008
Springer
14 years 5 months ago
Learning with Temporary Memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
Steffen Lange, Samuel E. Moelius, Sandra Zilles
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 9 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
PROVSEC
2009
Springer
14 years 1 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 8 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...