Sciweavers

3131 search results - page 583 / 627
» Generalized connection caching
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
183
Voted
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
162
Voted
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 10 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
184
Voted
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 10 months ago
Indexing multi-dimensional data in a cloud system
Providing scalable database services is an essential requirement for extending many existing applications of the Cloud platform. Due to the diversity of applications, database ser...
Jinbao Wang, Sai Wu, Hong Gao, Jianzhong Li, Beng ...
148
Voted
SPAA
2010
ACM
15 years 10 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...