2252 search results - page 171 / 451 » Lower Bounds for Dynamic Algorithms |
152
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
101
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
114
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
104
click to vote
ITC
2003
IEEE
15 years 8 months ago
2003
IEEE
Intermittent scan chain hold-time fault is discussed in this paper and a method to diagnose the faulty site in a scan chain is proposed as well. Unlike the previous scan chain dia...
127
Voted
DAGSTUHL
2004
15 years 5 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...