Sciweavers

6274 search results - page 279 / 1255
» From query complexity to computational complexity
Sort
View
CRYPTO
1994
Springer
104views Cryptology» more  CRYPTO 1994»
15 years 9 months ago
Cryptographic Randomness from Air Turbulence in Disk Drives
Abstract. A computer disk drive's motor speed varies slightly but irregularly, principally because of air turbulence inside the disk's enclosure. The unpredictability of ...
Don Davis, Ross Ihaka, Philip Fenstermacher
138
Voted
EDBT
2000
ACM
15 years 8 months ago
Materialized View Selection for Multi-Cube Data Models
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
DAIS
2010
15 years 6 months ago
A Reconfiguration Language for Virtualized Grid Infrastructures
The growing needs in computational power to answer to the increasing number of on-line services and the complexity of applications makes it mandatory to build corresponding hardwar...
Rémy Pottier, Marc Léger, Jean-Marc ...
127
Voted
STACS
2005
Springer
15 years 10 months ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 2 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt