1447 search results - page 195 / 290 » Graphs and Path Equilibria |
178
click to vote
MST
2002
15 years 6 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
151
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
192
click to vote
NETWORKS
2007
15 years 5 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...
164
click to vote
CORR
2010
Springer
15 years 5 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...
132
click to vote
ICRA
2010
IEEE
15 years 4 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...