Sciweavers

705 search results - page 86 / 141
» Proximity Cluster Trees
Sort
View
P2P
2002
IEEE
103views Communications» more  P2P 2002»
14 years 18 days ago
Towards a Hierarchical, Semantic Peer-to-Peer Topology
We propose a new p2p network topology that reduces bandwidth consumption and provides complete searches by employing a tree hierarchy of indexing nodes that facilitates the search...
Roman Kurmanowytsch, Mehdi Jazayeri, Engin Kirda
APVIS
2007
13 years 9 months ago
Navigation techniques for 2.5D graph layout
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
Adel Ahmed, Seok-Hee Hong
COLING
2008
13 years 9 months ago
Recent Advances in a Feature-Rich Framework for Treebank Annotation
This paper presents recent advances in an established treebank annotation framework comprising of an abstract XMLbased data format, fully customizable editor of tree-based annotat...
Petr Pajas, Jan Stepánek
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 9 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 1 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud