Sciweavers

241 search results - page 24 / 49
» On Generating Independent Random Strings
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
QOSA
2010
Springer
13 years 11 months ago
Validating Model-Driven Performance Predictions on Random Software Systems
Abstract. Software performance prediction methods are typically validated by taking an appropriate software system, performing both performance predictions and performance measurem...
Vlastimil Babka, Petr Tuma, Lubomír Bulej
IEEEIAS
2009
IEEE
14 years 2 months ago
Modeling the Co-evololution DNS Worms and Anti-worms in IPv6 Networks
A computer worm is an autonomous malicious, selfreplicating and propagating piece of code that is able to spread fast in computer networks, exploiting the vulnerabilities it disco...
Pantelis Kammas, Thodoros Komninos, Yannis C. Stam...
NAACL
2003
13 years 8 months ago
Implicit Trajectory Modeling through Gaussian Transition Models for Speech Recognition
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...
Hua Yu, Tanja Schultz
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen