1029 search results - page 28 / 206 » Probabilistic Recurrence Relations |
HYBRID
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. This paper proposes an account of the acquisition of grammatical relations using the basic concepts of connectionism and a construction-based theory of grammar. Many prev...
TIT
2008
14 years 10 months ago
2008
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
STRINGOLOGY
2008
14 years 11 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
71
Voted
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
We describe a new method to find and cluster recurrent keyplaces in a movie. It consists of an unsupervised classification of shots that are taking place in the same physical loca...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...