Sciweavers

298 search results - page 21 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
COMCOM
2006
120views more  COMCOM 2006»
14 years 9 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti
TIT
2011
149views more  TIT 2011»
14 years 4 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
92
Voted
COCOA
2009
Springer
15 years 25 days ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
INFOCOM
2000
IEEE
15 years 1 months ago
On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
— The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. After addressing the characteristics of wireless netw...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...