Sciweavers

203 search results - page 21 / 41
» Exponentiable morphisms of domains
Sort
View
CSDA
2007
94views more  CSDA 2007»
13 years 7 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen
MCSS
2006
Springer
13 years 7 months ago
Global complete observability and output-to-state stability imply the existence of a globally convergent observer
In this paper we consider systems which are globally completly observable and output-to-state stable. The former property guarantees the existence of coordinates such that the dyna...
Alessandro Astolfi, Laurent Praly
TCS
2008
13 years 7 months ago
Motif patterns in 2D
Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computa...
Alberto Apostolico, Laxmi Parida, Simona E. Rombo
AICOM
2004
92views more  AICOM 2004»
13 years 7 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
SIAMNUM
2010
99views more  SIAMNUM 2010»
13 years 2 months ago
On the Fourier Extension of Nonperiodic Functions
We obtain exponentially accurate Fourier series for nonperiodic functions on the interval [-1, 1] by extending these functions to periodic functions on a larger domain. The series ...
Daan Huybrechs