3007 search results - page 264 / 602 » Linear Functional Fixed-points |
129
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper presents a sufficient condition that establishes closed loop stability for linear time invariant dynamical systems with transfer functions that are analytic in the ...
177
click to vote
COCO
2000
Springer
15 years 8 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
145
click to vote
COLT
1998
Springer
15 years 8 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
178
click to vote
COCO
1997
Springer
15 years 8 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
118
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...