Sciweavers

7648 search results - page 1194 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
16 years 4 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
16 years 1 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
SAC
2009
ACM
15 years 10 months ago
Capturing truthiness: mining truth tables in binary datasets
We introduce a new data mining problem: mining truth tables in binary datasets. Given a matrix of objects and the properties they satisfy, a truth table identifies a subset of pr...
Clifford Conley Owens III, T. M. Murali, Naren Ram...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
ICCCN
2008
IEEE
15 years 10 months ago
Policy Distribution Methods for Function Parallel Firewalls
—Parallel firewalls offer a scalable low latency design for inspecting packets at high speeds. Typically consisting of an array of m firewalls, these systems filter arriving p...
Michael R. Horvath, Errin W. Fulp, Patrick Wheeler
« Prev « First page 1194 / 1530 Last » Next »