Sciweavers

756 search results - page 17 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
KDD
1998
ACM
183views Data Mining» more  KDD 1998»
14 years 6 days ago
Mining Generalized Association Rules and Sequential Patterns Using SQL Queries
Database integration of mining is becoming increasingly important with tile installation of larger and larger data warehouses built around relational database technology. Most of ...
Shiby Thomas, Sunita Sarawagi
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa
VISUALIZATION
1995
IEEE
13 years 11 months ago
Automatic Generation of Triangular Irregular Networks Using Greedy Cuts
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
13 years 11 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
DAC
2008
ACM
14 years 9 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung