501 search results - page 13 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
WIOPT
2011
IEEE
12 years 11 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
CCCG
2008
13 years 9 months ago
2008
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...