275 search results - page 23 / 55 » join 2007 |
104
Voted
DM
2007
15 years 12 days ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
146
click to vote
CN
2007
15 years 13 days ago
2007
In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New ...
80
Voted
CN
2007
15 years 13 days ago
2007
The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is ...
119
Voted
PDPTA
2004
15 years 1 months ago
2004
This paper presents our on-going research into selforganizing and self-healing networks of resource brokers, for use in complex Peer-to-Peer (P2P) resource sharing and Grid comput...
174
Voted
SIGMOD
2007
ACM
16 years 17 days ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...