Sciweavers

331 search results - page 29 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 3 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
14 years 7 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
77
Voted
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 1 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
DELOS
2004
14 years 11 months ago
Hyperdatabase Infrastructure for Management and Search of Multimedia Collections
Abstract. Nowadays, digital libraries are inherently dispersed over several peers of a steadily increasing network. Dedicated peers may provide specialized, computationally expensi...
Michael Mlivoncic, Christoph Schuler, Can Tür...