226 search results - page 40 / 46 » Lower bounds on the obstacle number of graphs |
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
ICCAD
2000
IEEE
14 years 9 days ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...