6568 search results - page 273 / 1314 » Reducing the Complexity of Reductions |
163
Voted
CSL
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
183
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
168
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
200
click to vote
VLSID
2004
IEEE
16 years 7 months ago
2004
IEEE
The increasing software content of battery-powered embedded systems has fueled much interest in techniques for developing energyefficient embedded software. Source code transforma...
156
click to vote
HPCA
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...