Sciweavers

1734 search results - page 85 / 347
» The Multimedia Multicasting Problem
Sort
View
BROADNETS
2004
IEEE
15 years 10 months ago
The Case for Multipath Multimedia Transport over Wireless Ad Hoc Networks
Real-time multimedia transport has stringent bandwidth, delay, and loss requirements. Supporting this application in current wireless ad hoc networks is a challenge. Such networks...
Yihan Li, Shiwen Mao, Shivendra S. Panwar
SPAA
2004
ACM
15 years 11 months ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...
CIC
2004
118views Communications» more  CIC 2004»
15 years 7 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
COLOGNETWENTE
2010
15 years 2 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos