5115 search results - page 521 / 1023 » On Randomized Lanczos Algorithms |
166
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
165
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
192
click to vote
CANDC
2005
ACM
15 years 8 months ago
2005
ACM
The story of some early computer art drawings in 1965 is told. It is a story of randomness. Computer art is viewed here as the programming of classes of aesthetic objects. In the ...
197
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
193
click to vote
ESTIMEDIA
2008
Springer
15 years 8 months ago
2008
Springer
Markov random field models provide a robust formulation of low-level vision problems. Among the problems, stereo vision remains the most investigated field. The belief propagation...