848 search results - page 74 / 170 » Randomness and the linear degrees of computability |
DM
2010
14 years 12 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
101
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
A visual representation of an object must meet at least three basic requirements. First, it must allow identification of the object in the presence of slight but unpredictable chan...