Sciweavers

874 search results - page 92 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
JCST
2008
119views more  JCST 2008»
14 years 10 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
JSC
2010
155views more  JSC 2010»
14 years 8 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
15 years 6 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
SSDBM
2010
IEEE
153views Database» more  SSDBM 2010»
15 years 3 months ago
Scalable Clustering Algorithm for N-Body Simulations in a Shared-Nothing Cluster
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
YongChul Kwon, Dylan Nunley, Jeffrey P. Gardner, M...
TCAD
1998
86views more  TCAD 1998»
14 years 9 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick