Sciweavers

336 search results - page 25 / 68
» Approximating Transitivity in Directed Networks
Sort
View
ICASSP
2010
IEEE
13 years 11 months ago
A survey of implementation efforts and experimental design for cooperative communications
Design and analysis of cooperative communication schemes based upon modeling and simulation exist in large quantities in the research literature. Despite this fact, there have bee...
Glenn Bradford, J. Nicholas Laneman
INFOCOM
2007
IEEE
14 years 5 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
INFOCOM
2010
IEEE
13 years 9 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu
STACS
2007
Springer
14 years 5 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
UAI
1997
14 years 6 days ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish