14 search results - page 3 / 3 » The Number of Bits Needed to Represent a Unit Disk Graph |
CISIS
2008
IEEE
13 years 7 months ago
2008
IEEE
Bluetooth standard allows the creation of piconets, with one node serving as its master and up to seven nodes serving as slaves. A Bluetooth ad hoc network can also be formed by in...
CIE
2010
Springer
13 years 9 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
ISTCS
1997
Springer
13 years 9 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...