1129 search results - page 218 / 226 » Finding Similar Failures Using Callstack Similarity |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
CHI
2004
ACM
14 years 8 months ago
2004
ACM
Weblogs (or blogs) are frequently updated webpages with posts typically in reverse-chronological order. Blogging is the latest form of online communication to gain widespread popu...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
ICDT
2010
ACM
14 years 5 months ago
2010
ACM
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...