Sciweavers

359 search results - page 10 / 72
» On the number of chord diagrams
Sort
View
DASFAA
2008
IEEE
114views Database» more  DASFAA 2008»
14 years 1 months ago
A P2P Meta-index for Spatio-temporal Moving Object Databases
In this paper we propose a distributed meta-index using a peer-to-peer protocol to allow spatio-temporal queries of moving objects on a large set of distributed database servers. W...
Cecilia Hernández, M. Andrea Rodrígu...
IPTPS
2004
Springer
14 years 25 days ago
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
Moni Naor, Udi Wieder
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 7 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau
AUIC
2005
IEEE
14 years 1 months ago
Generating Web-based User Interfaces for Diagramming Tools
Thin-client diagramming tools provide a number of advantages over traditional thick-client design tools but are challenging to build. We describe an extension to a thick-client me...
Shuping Cao, John C. Grundy, John G. Hosking, Herm...
P2P
2006
IEEE
130views Communications» more  P2P 2006»
14 years 1 months ago
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough