2252 search results - page 26 / 451 » Lower Bounds for Dynamic Algorithms |
DAGSTUHL
2004
13 years 9 months ago
2004
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...