Sciweavers

65 search results - page 12 / 13
» Efficient Memory Bound Puzzles Using Pattern Databases
Sort
View
ICDE
2007
IEEE
131views Database» more  ICDE 2007»
13 years 11 months ago
Incremental Clustering of Mobile Objects
Moving objects are becoming increasingly attractive to the data mining community due to continuous advances in technologies like GPS, mobile computers, and wireless communication ...
Sigal Elnekave, Mark Last, Oded Maimon
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 9 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 5 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 5 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 2 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup