5100 search results - page 649 / 1020 » The Linear Complexity of a Graph |
161
click to vote
WDAG
2005
Springer
16 years 5 days ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
190
click to vote
BVAI
2005
Springer
16 years 5 days ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
173
click to vote
DIALM
2004
ACM
16 years 4 days ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
164
click to vote
ISPD
2004
ACM
16 years 4 days ago
2004
ACM
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
188
click to vote
SACMAT
2004
ACM
16 years 4 days ago
2004
ACM
In order to provide a general access control methodology for parts of XML documents, we propose combining rolebased access control as found in the Role Graph Model, with a methodo...