1243 search results - page 76 / 249 » Complexity reduction of C-Algorithm |
ICCD
2004
IEEE
15 years 10 months ago
2004
IEEE
Although scan-based designs are widely used in order to reduce the complexity of test generation, test application time and test data volume are substantially increased. We propos...
106
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
133
click to vote
LSSC
2007
Springer
15 years 7 months ago
2007
Springer
Model reduction of large-scale linear time-invariant systems is an ubiquitous task in control and simulation of complex dynamical processes. We discuss how LQG balanced truncation ...
134
click to vote
ICTCS
2005
Springer
15 years 6 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
117
click to vote
ASIACRYPT
1999
Springer
15 years 5 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...