3874 search results - page 320 / 775 » Approximation Algorithms for k-hurdle Problems |
175
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
120
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
114
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
165
Voted
ACL
1997
15 years 6 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
145
Voted
TIP
2008
15 years 4 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...