Sciweavers

1716 search results - page 339 / 344
» Proving Conditional Termination
Sort
View
MP
2002
165views more  MP 2002»
13 years 9 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
MP
2002
195views more  MP 2002»
13 years 9 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 9 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
NDJFL
1998
100views more  NDJFL 1998»
13 years 9 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
PAMI
2008
235views more  PAMI 2008»
13 years 9 months ago
Dependent Multiple Cue Integration for Robust Tracking
We propose a new technique for fusing multiple cues to robustly segment an object from its background in video sequences that suffer from abrupt changes of both illumination and po...
Francesc Moreno-Noguer, Alberto Sanfeliu, Dimitris...