Sciweavers

1139 search results - page 183 / 228
» Bounded Ideation Theory
Sort
View
ECCC
2000
158views more  ECCC 2000»
13 years 7 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
SIAMCO
2000
75views more  SIAMCO 2000»
13 years 7 months ago
Generic Simplicity of the Spectrum and Stabilization for a Plate Equation
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
Jaime H. Ortega, Enrique Zuazua
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
13 years 7 months ago
On Bayes Methods for On-Line Boolean Prediction
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
IPL
2002
118views more  IPL 2002»
13 years 7 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
IPL
2002
93views more  IPL 2002»
13 years 7 months ago
Storing information with extractors
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
Amnon Ta-Shma