Sciweavers

32 search results - page 3 / 7
» On the complexity of cutting plane proofs using split cuts
Sort
View
CGF
2007
127views more  CGF 2007»
13 years 6 months ago
A Finite Element Method on Convex Polyhedra
We present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced ...
Martin Wicke, Mario Botsch, Markus H. Gross
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 6 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
CP
2004
Springer
13 years 11 months ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
MP
2006
87views more  MP 2006»
13 years 6 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
CP
2006
Springer
13 years 10 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed