Sciweavers

9719 search results - page 1922 / 1944
» Answer Set Optimization
Sort
View
CCR
2004
90views more  CCR 2004»
13 years 7 months ago
A constraint satisfaction approach to testbed embedding services
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...
BIOINFORMATICS
2007
190views more  BIOINFORMATICS 2007»
13 years 7 months ago
Towards clustering of incomplete microarray data without the use of imputation
Motivation: Clustering technique is used to find groups of genes that show similar expression patterns under multiple experimental conditions. Nonetheless, the results obtained by...
Dae-Won Kim, Ki Young Lee, Kwang H. Lee, Doheon Le...
CN
2002
77views more  CN 2002»
13 years 7 months ago
Architecture of a Web server accelerator
We describe the design, implementation and performance of a high-performance Web server accelerator which runs on an embedded operating system and improves Web server performance ...
Junehwa Song, Arun Iyengar, Eric Levy-Abegnoli, Da...
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 7 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
« Prev « First page 1922 / 1944 Last » Next »