76 search results - page 7 / 16 » isaac 2005 |
93
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show tha...
140
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
127
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
134
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
113
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...