5647 search results - page 1061 / 1130 » A word from the editor |
104
click to vote
LATA
2010
Springer
15 years 2 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
102
click to vote
COCO
1994
Springer
15 years 2 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
102
click to vote
SIGGRAPH
1993
ACM
15 years 2 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
STOC
1993
ACM
15 years 2 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
STOC
1993
ACM
15 years 2 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...