Sciweavers

953 search results - page 100 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
14 years 9 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani
DCC
2006
IEEE
14 years 7 months ago
Tradeoffs in XML Database Compression
Large XML data files, or XML databases, are now a common way to distribute scientific and bibliographic data, and storing such data efficiently is an important concern. A number o...
James Cheney
FMCAD
2000
Springer
13 years 11 months ago
Scalable Distributed On-the-Fly Symbolic Model Checking
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
Shoham Ben-David, Tamir Heyman, Orna Grumberg, Ass...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 8 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang