Sciweavers

7930 search results - page 80 / 1586
» Greedy in Approximation Algorithms
Sort
View
BMEI
2009
IEEE
15 years 7 months ago
A Kurtosis and Skewness Based Criterion for Model Selection on Gaussian Mixture
The Gaussian mixture model is a powerful statistical tool in data modeling and analysis. Generally, the EM algorithm is utilized to learn the parameters of the Gaussian mixture. Ho...
Lin Wang, Jinwen Ma
CP
2003
Springer
15 years 11 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 9 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
JSAC
2010
194views more  JSAC 2010»
15 years 4 months ago
Burst communication by means of buffer allocation in body sensor networks: Exploiting signal processing to reduce the number of
Abstract—Monitoring human movements using wireless sensory devices promises to revolutionize the delivery of healthcare services. Such platforms use inertial information of their...
Hassan Ghasemzadeh, Vitali Loseu, Sarah Ostadabbas...
ICCV
2011
IEEE
14 years 6 months ago
Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
Gunhee Kim, Eric P. Xing, Li Fei-Fei, Takeo Kanade