2252 search results - page 71 / 451 » Lower Bounds for Dynamic Algorithms |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
ICCAD
1998
IEEE
13 years 12 months ago
1998
IEEE
Presented in this paper are 1) information-theoretic lower bounds on energy consumption of noisy digital gates and 2) the concept of noise tolerance via coding for achieving energy...
NETWORKS
2008
13 years 7 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...