709 search results - page 38 / 142 » On LR(k)-Parsers of Polynomial Size |
ECCC
2006
14 years 9 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
73
Voted
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
We consider the task of assembling a large number of self controlled parts (or robots) into copies of a prescribed assembly (or formation). In particular, we introduce a way to sy...