313 search results - page 20 / 63 » Redundancy Elimination for LF |
196
click to vote
MICRO
2000
IEEE
14 years 11 months ago
2000
IEEE
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
100
click to vote
ISPAN
2000
IEEE
15 years 4 months ago
2000
IEEE
We present new architectural concepts for uniprocessor designs that conform to the data-driven computation paradigm. Usage of our D2 -CPU (Data-Driven processor) follows the natura...
SIGMOD
2002
ACM
15 years 12 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
117
click to vote
MLDM
2007
Springer
15 years 5 months ago
2007
Springer
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
VLSID
2004
IEEE
16 years 4 days ago
2004
IEEE
It has been observed that even highly optimized software programs perform "redundant" computations during their execution, due to the nature (statistics) of the values a...