Sciweavers

10462 search results - page 2037 / 2093
» Towards a
Sort
View
JCT
2007
111views more  JCT 2007»
13 years 8 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
TON
2008
107views more  TON 2008»
13 years 8 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
TON
2008
126views more  TON 2008»
13 years 8 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
TPDS
2008
87views more  TPDS 2008»
13 years 8 months ago
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
Due to the lack of stability and reliability in peer-to-peer networks, multimedia streaming over peer-to-peer networks represents several fundamental engineering challenges. First...
Chuan Wu, Baochun Li
TPDS
2008
140views more  TPDS 2008»
13 years 8 months ago
High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
Supranamaya Ranjan, Edward W. Knightly
« Prev « First page 2037 / 2093 Last » Next »