829 search results - page 101 / 166 » Distance domination-critical graphs |
136
click to vote
ICPR
2002
IEEE
16 years 7 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...
176
click to vote
PERCOM
2004
ACM
16 years 5 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...
175
click to vote
ICSE
2009
IEEE-ACM
16 years 1 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...
160
click to vote
CAIP
2009
Springer
16 years 27 days 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...
176
click to vote
DDECS
2008
IEEE
16 years 23 days 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...