829 search results - page 101 / 166 » Distance domination-critical graphs |
ICPR
2002
IEEE
16 years 29 days 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...
101
click to vote
PERCOM
2004
ACM
15 years 11 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...
ICSE
2009
IEEE-ACM
15 years 6 months ago
2009
IEEE-ACM
Social networking systems help people maintain connections to their friends, enabling awareness, communication, and collaboration, especially at a distance. In many studies of coo...
CAIP
2009
Springer
15 years 6 months ago
2009
Springer
Segmentation of Nom characters from body text regions of stele images is a challenging problem due to the confusing spatial distribution of the connected components composing these...
104
click to vote
DDECS
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...