526 search results - page 39 / 106 » On the Number of Minimal Addition Chains |
100
click to vote
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
CGO
2003
IEEE
15 years 1 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
PDPTA
2004
14 years 11 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
108
click to vote
SIGMETRICS
2003
ACM
15 years 3 months ago
2003
ACM
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
JMLR
2006
14 years 9 months ago
2006
We introduce a computational design for pattern detection based on a tree-structured network of support vector machines (SVMs). An SVM is associated with each cell in a recursive ...