10988 search results - page 256 / 2198 » Algorithmic Folding Complexity |
149
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
141
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
138
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
141
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
142
click to vote
COCO
2004
Springer
15 years 7 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...