Sciweavers

2996 search results - page 86 / 600
» Numberings and Randomness
Sort
View
FOCS
1989
IEEE
15 years 4 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
ICSE
2008
IEEE-ACM
16 years 1 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
104
Voted
ICASSP
2009
IEEE
15 years 7 months ago
On the error exponents for detecting randomly sampled noisy diffusion processes
This paper deals with the detection of a continuous random process described by an Ornstein-Uhlenbeck (O-U) stochastic differential equation. Randomly spaced sensors or equivalent...
Walid Hachem, Eric Moulines, Jamal Najim, Fran&cce...
97
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 23 days ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 29 days ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh