Sciweavers

791 search results - page 128 / 159
» Approximating the Maximum Sharing Problem
Sort
View
138
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 3 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
133
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi
INFOCOM
2007
IEEE
15 years 9 months ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
15 years 9 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...