Sciweavers

129 search results - page 23 / 26
» The Parameterized Complexity of the Minimum Shared Edges Pro...
Sort
View
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 3 months ago
Resource Optimization to Provision a Virtual Private Network Using the Hose Model
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, providers nee...
Monia Ghobadi, Sudhakar Ganti, Gholamali C. Shoja
SPAA
2009
ACM
15 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
ICIP
2007
IEEE
15 years 11 months ago
Modeling of Front Evolution with Graph Cut Optimization
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
Hang Chang, Qing Yang, Manfred Auer, Bahram Parvin
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 3 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan