2520 search results - page 160 / 504 » The complexity of approximating entropy |
HICSS
2002
IEEE
15 years 3 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
INFOCOM
2002
IEEE
15 years 3 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
80
Voted
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
— Interleave division multiple access (IDMA) recently attracted many research activities because of its excellent performance despite its reasonable low complexity. The low compl...
73
Voted
COCO
2003
Springer
15 years 4 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
COMPGEOM
2008
ACM
15 years 20 days ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...