63 search results - page 8 / 13 » On a Geometric Generalization of the Upper Bound Theorem |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected...
82
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
WADS
2005
Springer
15 years 2 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...