Sciweavers

5658 search results - page 29 / 1132
» An Efficient Counting Network
Sort
View
INFOVIS
1999
IEEE
14 years 2 months ago
Efficient Multi-Object Dynamic Query Histograms
Dynamic Queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects an...
Mark Derthick, James Harrison, Andrew Moore, Steve...
DAWAK
2008
Springer
13 years 11 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
14 years 2 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
13 years 11 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...