Sciweavers

971 search results - page 146 / 195
» Approximate Satisfiability and Equivalence
Sort
View
PE
2011
Springer
214views Optimization» more  PE 2011»
14 years 6 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
SIAMNUM
2011
328views more  SIAMNUM 2011»
14 years 6 months ago
First-Order System Least Squares for Coupled Stokes-Darcy Flow
The coupled problem with Stokes flow in one subdomain and a Darcy flow model in a second subdomain is studied in this paper. Both flow problems are treated as first-order syste...
Steffen Münzenmaier, Gerhard Starke
JMLR
2010
145views more  JMLR 2010»
14 years 6 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
SIAMJO
2010
97views more  SIAMJO 2010»
14 years 6 months ago
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 3 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin