Sciweavers

2862 search results - page 323 / 573
» Bicriteria Network Design Problems
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
16 years 5 days ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
MOBISYS
2009
ACM
16 years 7 months ago
Wifi-reports: improving wireless network selection with collaboration
Wi-Fi clients can obtain much better performance at some commercial hotspots than at others. Unfortunately, there is currently no way for users to determine which hotspot access p...
Jeffrey Pang, Ben Greenstein, Michael Kaminsky, Da...
MOBIHOC
2005
ACM
16 years 6 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
WWW
2010
ACM
16 years 1 months ago
Privacy wizards for social networking sites
Privacy is an enormous problem in online social networking sites. While sites such as Facebook allow users fine-grained control over who can see their profiles, it is difficult ...
Lujun Fang, Kristen LeFevre
SPAA
2005
ACM
16 years 6 days ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...