Sciweavers

5608 search results - page 952 / 1122
» On the Theory of Matchgate Computations
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 1 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 1 months ago
Modeling Cultural Dynamics
EVOC (for EVOlution of Culture) is a computer model of culture that enables us to investigate how various factors such as barriers to cultural diffusion, the presence and choice o...
Liane Gabora
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 1 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
104
Voted
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 1 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
DCG
2008
82views more  DCG 2008»
15 years 1 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld