Sciweavers

12659 search results - page 2302 / 2532
» The distributed breakout algorithms
Sort
View
GIS
2004
ACM
16 years 7 months ago
A serverless 3D world
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana N...
WWW
2003
ACM
16 years 7 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
16 years 24 days ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
WWW
2003
ACM
16 years 7 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 7 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
« Prev « First page 2302 / 2532 Last » Next »