Sciweavers

227 search results - page 39 / 46
» Approximation of the Quadratic Set Covering problem
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Convexity and Bayesian Constrained Local Models
The accurate localization of facial features plays a fundamental role in any face recognition pipeline. Constrained local models (CLM) provide an effective approach to localizati...
Ulrich Paquet (Imense Ltd)
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
13 years 2 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
MP
2002
110views more  MP 2002»
13 years 7 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski
ORL
2006
105views more  ORL 2006»
13 years 7 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
CLA
2007
13 years 8 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil