Sciweavers

2040 search results - page 89 / 408
» Approximate Expectation Maximization
Sort
View
OPODIS
2008
15 years 1 months ago
Distributed Approximation of Cellular Coverage
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub
94
Voted
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 1 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
AIPS
2000
15 years 1 months ago
A New Perspective on Algorithms for Optimizing Policies under Uncertainty
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
Rina Dechter
ICML
2006
IEEE
16 years 14 days ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
CBMS
2005
IEEE
15 years 5 months ago
Approximations to Magic: Finding Unusual Medical Time Series
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
Jessica Lin, Eamonn J. Keogh, Ada Wai-Chee Fu, Hel...