Sciweavers

87 search results - page 5 / 18
» Completeness Estimation of Range Queries in Structured Overl...
Sort
View
TON
2008
126views more  TON 2008»
14 years 9 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
INFOCOM
2009
IEEE
15 years 4 months ago
Respondent-Driven Sampling for Characterizing Unstructured Overlays
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
Amir Hassan Rasti, Mojtaba Torkjazi, Reza Rejaie, ...
GIR
2006
ACM
15 years 3 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
IJCGA
2000
85views more  IJCGA 2000»
14 years 9 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
RTDB
1996
84views more  RTDB 1996»
14 years 10 months ago
Performance-Polymorphic Execution of Real-Time Queries
We are developing an object-oriented real-time database system that includes a relationally complete query language. Unlike conventional query optimizers, our optimizer estimates ...
Thomas Padron-McCarthy, Tore Risch