1469 search results - page 140 / 294 » Characterizing the Structural Complexity of Real-World Compl... |
141
click to vote
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a new method of detecting and predicting motion tracking failures with applications in human motion and gait analysis. We define a tracking failure as an event...
117
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
151
click to vote
ISMVL
1997
IEEE
15 years 8 months ago
1997
IEEE
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
125
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
131
click to vote
AUTOMATICA
2005
15 years 3 months ago
2005
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...