1664 search results - page 268 / 333 » Distance labeling in graphs |
130
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
152
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
144
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
112
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
144
click to vote
PERCOM
2004
ACM
16 years 3 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...