2252 search results - page 260 / 451 » Lower Bounds for Dynamic Algorithms |
148
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
174
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
157
click to vote
EUC
2007
Springer
16 years 21 days ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
195
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
216
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...