848 search results - page 43 / 170 » Randomness and the linear degrees of computability |
111
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
149
click to vote
CIARP
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
122
Voted
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— For linear and hybrid systems, constrained timeoptimal control was shown to be a low complexity alternative to the explicit solution of the constrained finite-time-opt...
131
click to vote
IMA
1995
Springer
15 years 9 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
179
click to vote
EUSFLAT
2009
15 years 3 months ago
2009
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...