Sciweavers

1991 search results - page 261 / 399
» Small Models of Large Machines
Sort
View
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
16 years 5 months ago
Mining Colossal Frequent Patterns by Core Pattern Fusion
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, H...
SIGMOD
2003
ACM
121views Database» more  SIGMOD 2003»
16 years 4 months ago
An environmental sensor network to determine drinking water quality and security
Finding patterns in large, real, spatio/temporal data continues to attract high interest (e.g., sales of products over space and time, patterns in mobile phone users; sensor netwo...
Anastassia Ailamaki, Christos Faloutsos, Paul S. F...
EDBT
2004
ACM
131views Database» more  EDBT 2004»
16 years 4 months ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
ICSE
2007
IEEE-ACM
16 years 4 months ago
Parallel Randomized State-Space Search
Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, s...
Matthew B. Dwyer, Sebastian G. Elbaum, Suzette Per...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 11 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...