Sciweavers

5624 search results - page 90 / 1125
» On Conditional Covering Problem
Sort
View
SYNTHESE
2008
112views more  SYNTHESE 2008»
15 years 6 months ago
A sufficient condition for pooling data
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
Frederick Eberhardt
AMAI
2000
Springer
15 years 10 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
CVPR
2009
IEEE
17 years 1 months ago
Max-Margin Hidden Conditional Random Fields for Human Action Recognition
We present a new method for classification with structured latent variables. Our model is formulated using the max-margin formalism in the discriminative learning literature. We...
Yang Wang 0003, Greg Mori
MP
2011
14 years 9 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng
SIAMNUM
2010
99views more  SIAMNUM 2010»
15 years 1 months ago
Analysis and Optimization of Robin-Robin Partitioned Procedures in Fluid-Structure Interaction Problems
In the solution of Fluid-Structure Interaction problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers, that interact, in an itera...
Luca Gerardo-Giorda, Fabio Nobile, Christian Verga...