Sciweavers

151 search results - page 24 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
TWC
2008
120views more  TWC 2008»
13 years 7 months ago
Binary Power Control for Sum Rate Maximization over Multiple Interfering Links
We consider allocating the transmit powers for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and...
Anders Gjendemsjø, David Gesbert, Geir E. &...
INFOCOM
2010
IEEE
13 years 5 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
COCOON
2005
Springer
14 years 27 days ago
Share the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
Weizhao Wang, Xiang-Yang Li, Zheng Sun
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
13 years 8 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen