2542 search results - page 402 / 509 » Computing Cartograms with Optimal Complexity |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
IPPS
2005
IEEE
14 years 3 months ago
2005
IEEE
Due to the increasing complexity, the behavior of large-scale distributed systems becomes difficult to predict. The ability of on-line identification and autotuning of adaptive co...
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— The wireless sensor network is an emerging technology that may greatly facilitate human life by providing ubiquitous sensing, computing, and communication capability. H...
BTW
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
DCOSS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...