Sciweavers

341 search results - page 52 / 69
» Quantum Computation and Lattice Problems
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
APSCC
2008
IEEE
14 years 2 months ago
Runtime Prediction Based Grid Scheduling of Parameter Sweep Jobs
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
Sam Verboven, Peter Hellinckx, Frans Arickx, Jan B...
CCGRID
2006
IEEE
14 years 1 months ago
Grid-User Driven Grid Research, The CoBRA Grid
A new multi-purpose LightWeight Grid system (LWG) is introduced, under the acronym CoBRA grid (Computational Basic Reprogrammable Adaptive grid). It provides the functionality gri...
Peter Hellinckx, Gunther Stuer, Wouter Hendrickx, ...
ICCV
2003
IEEE
14 years 29 days ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock
DAC
2003
ACM
14 years 8 months ago
A transformation based algorithm for reversible logic synthesis
A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are of interest in quantum computing, optical computing...
D. Michael Miller, Dmitri Maslov, Gerhard W. Dueck