Sciweavers

381 search results - page 43 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
CVPR
2011
IEEE
13 years 2 months ago
Intrinsic Dense 3D Surface Tracking
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
Yun Zeng, Chaohui Wang, Yang Wang, David Gu, Dimit...
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
12 years 10 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
APSEC
2000
IEEE
14 years 4 days ago
A comparative evaluation of techniques for syntactic level source code analysis
Many program maintenance tools rely on traditional parsing techniques to obtain syntactic level models of the code being maintained. When, for some reason, code cannot be parsed, ...
Anthony Cox, Charles L. A. Clarke