7971 search results - page 2 / 1595 » On unbounded operators and applications |
COCO
2000
Springer
13 years 10 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
COLING
1990
13 years 7 months ago
1990
: This paper outlines a framework for connectionist representation based on the composition of connectionist states under vector space operators. The framework is used to specify a...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
RV
2009
Springer
14 years 8 days ago
2009
Springer
Synthesizing monitor circuits for LTL formulas is expensive, because the number of flip-flops in the circuit is exponential in the length of the formula. As a result, the IEEE st...