Sciweavers

1891 search results - page 273 / 379
» Constrained Subspace Modelling
Sort
View
GRAMMARS
2002
119views more  GRAMMARS 2002»
13 years 10 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
CISIS
2009
IEEE
13 years 8 months ago
Simultaneous Background/Foreground Segmentation and Contour Smoothing with Level Set Based Partial Differential Equation for Int
In this paper, we propose a level set based energy functional, the minimization of which results in simultaneous background modeling, foreground segmentation, and contour smoothin...
Suk Ho Lee, Nam-seok Choi, Byung-Gook Lee, Moon Gi...
ICDAR
2009
IEEE
13 years 8 months ago
Handwritten Word Image Retrieval with Synthesized Typed Queries
We propose a new method for handwritten word-spotting which does not require prior training or gathering examples for querying. More precisely, a model is trained "on the fly...
José A. Rodríguez-Serrano, Florent P...
CDC
2010
IEEE
13 years 5 months ago
Trajectory generation using sum-of-norms regularization
Abstract-- Many tracking problems are split into two subproblems, first a smooth reference trajectory is generated that meet the control design objectives, and then a closed loop c...
Henrik Ohlsson, Fredrik Gustafsson, Lennart Ljung,...
ICLP
2011
Springer
13 years 1 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...