Sciweavers

1222 search results - page 101 / 245
» corr 2008
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 7 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 7 months ago
Topological Observations on Multiplicative Additive Linear Logic
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
André Hirschowitz, Michel Hirschowitz, Tom ...
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 7 months ago
Quantum walk based search algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
Miklos Santha
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 7 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 7 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic