1554 search results - page 60 / 311 » Parameterized Complexity and Approximation Algorithms |
108
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
151
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
152
Voted
FSTTCS
2010
Springer
15 years 19 days ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
138
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
93
Voted
PODS
2004
ACM
16 years 2 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...