5595 search results - page 805 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
AIPS
2009
15 years 7 months ago
2009
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
183
click to vote
PAMI
2008
15 years 6 months ago
2008
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
180
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
164
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
194
click to vote
TC
2010
15 years 1 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...