Sciweavers

7129 search results - page 1078 / 1426
» Approximation Algorithms for Treewidth
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 10 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
137
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
Real-Time Video Multicast in WiMAX Networks
Abstract—IEEE 802.16e WiMAX is a promising new technology for broadband access networks. Amongst the class of applications that can be supported is real time video services (such...
Supratim Deb, Sharad Jaiswal, Kanthi Nagaraj
PODC
2005
ACM
15 years 9 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 9 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
HPDC
2003
IEEE
15 years 9 months ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...
« Prev « First page 1078 / 1426 Last » Next »