2173 search results - page 185 / 435 » On the Values of Reducibility Candidates |
252
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
138
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
The presence of unknown values in the simulation result is a key barrier to effective output response compaction in practice. This paper proposes a simple circuit module, called a...
160
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
157
click to vote
ICC
2007
IEEE
16 years 26 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
156
click to vote
MICRO
1997
IEEE
15 years 10 months ago
1997
IEEE
As processors continue to exploit more instruction level parallelism, a greater demand is placed on reducing the e ects of memory access latency. In this paper, we introduce a nov...