Sciweavers

3757 search results - page 391 / 752
» The overlap number of a graph
Sort
View
IMCSIT
2010
15 years 4 months ago
Efficient Coloring of Wireless Ad Hoc Networks With Diminished Transmitter Power
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
Krzysztof Krzywdzinski
LATIN
2010
Springer
16 years 1 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant
DASFAA
2007
IEEE
172views Database» more  DASFAA 2007»
16 years 1 months ago
Optimizing Multiple In-Network Aggregate Queries in Wireless Sensor Networks
Abstract. In this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial ...
Huei-You Yang, Wen-Chih Peng, Chia-Hao Lo
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 1 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
SPAA
2004
ACM
16 years 6 days ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran