Sciweavers

617 search results - page 86 / 124
» Patterns for decoupling data structures and algorithms
Sort
View
ICDM
2003
IEEE
160views Data Mining» more  ICDM 2003»
14 years 1 months ago
Indexing and Mining Free Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
Yun Chi, Yirong Yang, Richard R. Muntz
IS
2007
13 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ISMIS
2005
Springer
14 years 1 months ago
Estimation of the Density of Datasets with Decision Diagrams
We address the problem of loading transactional datasets into main memory and estimating the density of such datasets. We propose BoolLoader, an algorithm dedicated to these tasks;...
Ansaf Salleb, Christel Vrain
ISNN
2005
Springer
14 years 1 months ago
Feature Selection and Intrusion Detection Using Hybrid Flexible Neural Tree
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
Yuehui Chen, Ajith Abraham, Ju Yang
EUROPAR
2001
Springer
14 years 6 days ago
Performance of High-Accuracy PDE Solvers on a Self-Optimizing NUMA Architecture
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
Sverker Holmgren, Dan Wallin