554 search results - page 73 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
180
Voted
PR
2007
15 years 5 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
181
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
176
click to vote
WWW
2011
ACM
15 years 22 days ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
211
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
164
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...