Sciweavers

23589 search results - page 4513 / 4718
» Uncheatable Distributed Computations
Sort
View
ICPPW
2002
IEEE
15 years 6 months ago
A Fast Handoff Scheme For IP over Bluetooth
Recently, the low price and the small size of the mobile device makes a great success in personal mobile communication. A lot of people use a cell phone, PDA, and laptop computer ...
Sang-Hun Chung, Hyunsoo Yoon, Jung Wan Cho
INFOCOM
2002
IEEE
15 years 6 months ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 6 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...
165
Voted
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
15 years 6 months ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 6 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
« Prev « First page 4513 / 4718 Last » Next »