12519 search results - page 41 / 2504 » Approximation Problems Categories |
100
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
152
Voted
IPCO
2004
15 years 3 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
102
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
108
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
143
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...