1554 search results - page 83 / 311 » Parameterized Complexity and Approximation Algorithms |
161
click to vote
TNN
2010
14 years 9 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
130
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
109
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
140
click to vote
AGI
2008
15 years 4 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
159
click to vote
ECRTS
2009
IEEE
15 years 23 days ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...