303 search results - page 42 / 61 » Update Algorithms for the Sketch Data Model |
159
click to vote
KDD
2005
ACM
15 years 10 months ago
2005
ACM
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
113
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
It is crucial for a web crawler to distinguish between ephemeral and persistent content. Ephemeral content (e.g., quote of the day) is usually not worth crawling, because by the t...
134
click to vote
ICIAP
1999
ACM
15 years 8 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
130
click to vote
HT
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we are interested in describing Web pages by how users interact within their contents. Thus, an alternate but complementary way of labelling and classifying Web docu...
138
click to vote
CAD
2004
Springer
15 years 4 months ago
2004
Springer
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...