Sciweavers

2143 search results - page 159 / 429
» corr 2010
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 6 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
CORR
2010
Springer
148views Education» more  CORR 2010»
15 years 6 months ago
Approximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
Sophie Toulouse
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 6 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
M. A. Iwen
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 6 months ago
A calculus for costed computations
We develop a version of the picalculus Picost where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of own...
Matthew Hennessy