Sciweavers

65 search results - page 11 / 13
» Efficient Memory Bound Puzzles Using Pattern Databases
Sort
View
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
14 years 8 months ago
Top-k Set Similarity Joins
Abstract-- Similarity join is a useful primitive operation underlying many applications, such as near duplicate Web page detection, data integration, and pattern recognition. Tradi...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Haichuan Sh...
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
14 years 6 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 10 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
IADIS
2003
13 years 7 months ago
Informatization and E-Business Model Application for Distributed Data Mining Using Mobile Agents
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
Ezendu Ifeanyi Ariwa, Mohamed B. Senousy, Mohamed ...
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 7 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou