Sciweavers

1477 search results - page 26 / 296
» Complexity of (iterated) dominance
Sort
View
136
Voted
WSC
1998
15 years 7 months ago
Rostering by Iterating Integer Programming and Simulation
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
Shane G. Henderson, Andrew J. Mason
CVPR
2006
IEEE
16 years 8 months ago
Escaping local minima through hierarchical model selection: Automatic object discovery, segmentation, and tracking in video
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
Nebojsa Jojic, John M. Winn, Larry Zitnick
EOR
2008
103views more  EOR 2008»
15 years 6 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
ICASSP
2009
IEEE
16 years 25 days ago
Complex NMF: A new sparse representation for acoustic signals
This paper presents a new sparse representation for acoustic signals which is based on a mixing model defined in the complex-spectrum domain (where additivity holds), and allows ...
Hirokazu Kameoka, Nobutaka Ono, Kunio Kashino, Shi...
ICIAP
1999
ACM
15 years 10 months ago
Improved Low Complexity Fully Parallel Thinning Algorithm
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation inv...
Thierry M. Bernard, Antoine Manzanera