Sciweavers

5523 search results - page 764 / 1105
» Improving application performance with hardware data structu...
Sort
View
DBA
2006
182views Database» more  DBA 2006»
15 years 8 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
FIMI
2004
123views Data Mining» more  FIMI 2004»
15 years 8 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
ACTA
2008
82views more  ACTA 2008»
15 years 6 months ago
Two-tier relaxed heaps
Abstract. We introduce an adaptation of run-relaxed heaps which provides efficient heap operations with respect to the number of element comparisons performed. Our data structure g...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
175
Voted
EMNLP
2009
15 years 4 months ago
Graph Alignment for Semi-Supervised Semantic Role Labeling
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
Hagen Fürstenau, Mirella Lapata
WWW
2007
ACM
16 years 7 months ago
Consistency-preserving caching of dynamic database content
With the growing use of dynamic web content generated from relational databases, traditional caching solutions for throughput and latency improvements are ineffective. We describe...
Niraj Tolia, M. Satyanarayanan