Sciweavers

1431 search results - page 194 / 287
» The complexity of random ordered structures
Sort
View
150
Voted
TAMC
2010
Springer
15 years 8 months ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
132
Voted
BMCBI
2004
153views more  BMCBI 2004»
15 years 3 months ago
Computational protein biomarker prediction: a case study for prostate cancer
Background: Recent technological advances in mass spectrometry pose challenges in computational mathematics and statistics to process the mass spectral data into predictive models...
Michael Wagner, Dayanand N. Naik, Alex Pothen, Sri...
152
Voted
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
14 years 3 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
ICSE
2009
IEEE-ACM
16 years 4 months ago
Taint-based directed whitebox fuzzing
We present a new automated white box fuzzing technique and a tool, BuzzFuzz, that implements this technique. Unlike standard fuzzing techniques, which randomly change parts of the...
Vijay Ganesh, Tim Leek, Martin C. Rinard
154
Voted
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 9 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai