1716 search results - page 156 / 344 » Proving Conditional Termination |
105
Voted
JMLR
2008
15 years 20 days ago
2008
We analyze the performance of a class of manifold-learning algorithms that find their output by minimizing a quadratic form under some normalization constraints. This class consis...
65
Voted
JGT
2006
15 years 19 days ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
100
Voted
ENTCS
2007
15 years 19 days ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
103
click to vote
MP
2008
15 years 19 days ago
2008
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
105
click to vote
SIAMJO
2008
15 years 18 days ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...