Sciweavers

3616 search results - page 153 / 724
» Conditional Memory Ordering
Sort
View
132
Voted
FLAIRS
2004
15 years 6 months ago
Computing Marginals with Hierarchical Acyclic Hypergraphs
How to compute marginals efficiently is one of major concerned problems in probabilistic reasoning systems. Traditional graphical models do not preserve all conditional independen...
S. K. Michael Wong, Tao Lin
ISCA
2007
IEEE
145views Hardware» more  ISCA 2007»
15 years 11 months ago
Mechanisms for store-wait-free multiprocessors
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
Thomas F. Wenisch, Anastassia Ailamaki, Babak Fals...
148
Voted
FLAIRS
2006
15 years 6 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
133
Voted
ESANN
2004
15 years 6 months ago
Computational model of amygdala network supported by neurobiological data
Abstract. The amygdala has repeatedly been involved in the processing of emotional reactions and conditioning. This paper presents a neurobiologically inspired computational model ...
Mélanie Falgairolle, Agnès Gorge, Je...
135
Voted
ORDER
2008
82views more  ORDER 2008»
15 years 5 months ago
Profinite Heyting Algebras
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
Guram Bezhanishvili, Nick Bezhanishvili