Sciweavers

201 search results - page 28 / 41
» Optimizing an objective function under a bivariate probabili...
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 6 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
PAMI
2008
132views more  PAMI 2008»
15 years 5 months ago
Trajectory Association across Multiple Airborne Cameras
A camera mounted on an aerial vehicle provides an excellent means to monitor large areas of a scene. Utilizing several such cameras on different aerial vehicles allows further flex...
Yaser Sheikh, Mubarak Shah
FGR
2000
IEEE
181views Biometrics» more  FGR 2000»
15 years 9 months ago
Face Detection Using Mixtures of Linear Subspaces
We present two methods using mixtures of linear subspaces for face detection in gray level images. One method uses a mixture of factor analyzers to concurrently perform clustering...
Ming-Hsuan Yang, Narendra Ahuja, David J. Kriegman
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 6 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova