383 search results - page 58 / 77 » A Bound on the Total Chromatic Number |
FOCS
2000
IEEE
14 years 2 days ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
ADBIS
2000
Springer
14 years 14 hour ago
2000
Springer
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
CIAC
1994
Springer
13 years 11 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
DCOSS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consum...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...