178 search results - page 31 / 36 » Fast Algorithms for Top-k Approximate String Matching |
105
click to vote
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
66
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
107
Voted
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
PODS
2000
ACM
15 years 1 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...