Sciweavers

2557 search results - page 404 / 512
» Real scaled matching
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 4 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
119
Voted
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 3 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
215
Voted
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 3 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
208
Voted
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
16 years 3 months ago
Mining Top-k Covering Rule Groups for Gene Expression Data
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu
114
Voted
ICIAP
2005
ACM
16 years 3 months ago
Automatic Updating of Urban Vector Maps
In this paper we propose an automatic updating system for urban vector maps that is able to detect changes between the old dataset (consisting of both vector and raster maps) and t...
S. Ceresola, Andrea Fusiello, Manuele Bicego, Albe...