1554 search results - page 223 / 311 » Parameterized Complexity and Approximation Algorithms |
81
Voted
JMM2
2007
15 years 2 months ago
2007
— In this paper, a single-ended quality measurement algorithm for noise suppressed speech is described. The proposed algorithm computes fast approximations of KullbackLeibler dis...
132
Voted
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
136
Voted
COCO
2005
Springer
15 years 8 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 ...
114
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
229
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...