3874 search results - page 660 / 775 » Approximation Algorithms for k-hurdle Problems |
131
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
112
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
151
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
136
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
146
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...