1154 search results - page 219 / 231 » On the editing distance of graphs |
TCS
2011
13 years 2 months ago
2011
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
ECIR
2011
Springer
12 years 11 months ago
2011
Springer
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...