1089 search results - page 97 / 218 » Randomness and Reducibility |
174
click to vote
ITC
2003
IEEE
15 years 11 months ago
2003
IEEE
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
135
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— For linear and hybrid systems, constrained timeoptimal control was shown to be a low complexity alternative to the explicit solution of the constrained finite-time-opt...
170
click to vote
PAKDD
2001
ACM
15 years 10 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
158
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
181
click to vote
ICPPW
1999
IEEE
15 years 10 months ago
1999
IEEE
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...