3096 search results - page 118 / 620 » The Generalized FITC Approximation |
121
click to vote
EACL
2009
ACL Anthology
16 years 3 months ago
2009
ACL Anthology
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
135
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
124
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
128
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
126
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...