2095 search results - page 110 / 419 » Improved pebbling bounds |
123
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
110
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
125
click to vote
ESA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
96
Voted
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...
99
Voted
FM
2001
Springer
15 years 5 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...