1986 search results - page 241 / 398 » Path Separability of Graphs |
147
Voted
NETWORKS
2007
15 years 3 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
128
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
99
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— Precise calibration of camera intrinsic and extrinsic parameters, while often useful, is difficult to obtain during field operation and presents scaling issues for mu...
154
Voted
SIGMETRICS
2011
ACM
14 years 6 months ago
2011
ACM
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
154
Voted
EMNLP
2011
14 years 3 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...