2698 search results - page 131 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
161
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
180
click to vote
WADS
2007
Springer
16 years 15 days ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
191
click to vote
STOC
2005
ACM
15 years 12 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
195
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
158
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...