Sciweavers

359 search results - page 4 / 72
» On the number of chord diagrams
Sort
View
CCCG
2003
13 years 8 months ago
Estimation of the necessary number of points in Riemannian Voronoi
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
Kensuke Onishi, Jin-ichi Itoh
IEAAIE
2009
Springer
14 years 2 months ago
Spatial Exact Match Query Based on the NA-Tree Approach in P2P Systems
In this paper, we propose to apply an NA-tree in the Chord system to encode spatial region data in the data key part used in the hash function to data search. That is, we combine t...
Ye-In Chang, Chen-Chang Wu, Ching-I Wang
IPTPS
2003
Springer
14 years 20 days ago
Koorde: A Simple Degree-Optimal Distributed Hash Table
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
M. Frans Kaashoek, David R. Karger
P2P
2005
IEEE
106views Communications» more  P2P 2005»
14 years 1 months ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
JCT
2010
117views more  JCT 2010»
13 years 5 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...