Sciweavers

347 search results - page 60 / 70
» Some Second Order Set Theory
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 8 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
ISOLA
2004
Springer
14 years 22 days ago
Static Timing Analysis of Real-Time Operating System Code
Methods for Worst-Case Execution Time (WCET) analysis have been known for some time, and recently commercial tools have emerged. However, the technique has so far not been much use...
Daniel Sandell, Andreas Ermedahl, Jan Gustafsson, ...
JCST
2008
119views more  JCST 2008»
13 years 7 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
ICDT
2007
ACM
121views Database» more  ICDT 2007»
14 years 1 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin