3958 search results - page 253 / 792 » Dynamic Graph Algorithms with Applications |
168
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
136
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
180
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
188
click to vote
DEXA
1998
Springer
15 years 11 months ago
1998
Springer
Intelligent agents and active databases have a number of common characteristics, the most important of which is that they both execute actions by firing rules upon events occurring...
179
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...