3096 search results - page 381 / 620 » Theory and Use of the EM Algorithm |
163
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
181
click to vote
3DPVT
2006
IEEE
16 years 19 days ago
2006
IEEE
We propose a mathematical approach for quantifying shape complexity of 3D surfaces based on perceptual principles of visual saliency. Our curvature variation measure (CVM), as a 3...
167
click to vote
IJCNN
2006
IEEE
16 years 18 days ago
2006
IEEE
— Inspired by Hebb’s cell assembly theory about how the brain worked, we have developed a function localization neural network (FLNN). The main part of a FLNN is structurally t...
137
click to vote
ACMSE
2006
ACM
16 years 16 days ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
161
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...