10901 search results - page 417 / 2181 » Approximations in Distributed Optimization |
239
click to vote
SIGCOMM
2010
ACM
15 years 7 months ago
2010
ACM
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
196
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
228
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
283
click to vote
COMPGEOM
2010
ACM
16 years 20 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...