38 search results - page 6 / 8 » Read-Once Polynomial Identity Testing |
153
click to vote
COCO
2009
Springer
16 years 12 days ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
141
click to vote
IROS
2007
IEEE
16 years 3 days ago
2007
IEEE
— This work is focused on the design of a rotor speed regulator for small-scale helicopters. A nominal model identification for the main rotor is performed using a hybrid proced...
163
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
169
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
166
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...