Sciweavers

3406 search results - page 351 / 682
» Computational models of classical conditioning
Sort
View
IPL
2006
104views more  IPL 2006»
15 years 6 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
NA
2008
297views more  NA 2008»
15 years 6 months ago
Generalized fast marching method: applications to image segmentation
In this paper, we propose a segmentation method based on the Generalized Fast Marching Method (GFMM) developed by Carlini et al.([6]). The classical Fast Marching Method (FMM) is a...
Nicolas Forcadel, Carole Le Guyader, Christian Gou...
TCS
2008
15 years 6 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
SIMPRA
2010
558views more  SIMPRA 2010»
15 years 5 months ago
Species abundance patterns in an ecosystem simulation studied through Fisher's logseries
We have developed an individual-based evolving predator-prey ecosystem simulation that integrates, for the first time, a complex individual behaviour model, an evolutionary mecha...
Didier Devaurs, Robin Gras
PAMI
2012
13 years 9 months ago
Nonlinear Shape Registration without Correspondences
—In this paper, we propose a novel framework to estimate the parameters of a diffeomorphism that aligns a known shape and its distorted observation. Classical registration method...
Csaba Domokos, Jozsef Nemeth, Zoltan Kato