792 search results - page 30 / 159 » A New Effective And Efficient Multi-Level Partitioning Algor... |
104
Voted
ASPDAC
2004
ACM
15 years 6 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
155
click to vote
DATAMINE
1999
15 years 2 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
137
Voted
PDPTA
2004
15 years 3 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...
164
Voted
AI
2005
Springer
15 years 2 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
228
click to vote
ICDE
2001
IEEE
16 years 3 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...