Sciweavers

291 search results - page 28 / 59
» Bias and the limits of pooling
Sort
View
ISCA
1995
IEEE
121views Hardware» more  ISCA 1995»
15 years 3 months ago
A Comparative Analysis of Schemes for Correlated Branch Prediction
Modern high-performance architectures require extremely accurate branch prediction to overcome the performance limitations of conditional branches. We present a framework that cat...
Cliff Young, Nicholas C. Gloy, Michael D. Smith
NIPS
2004
15 years 1 months ago
Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
Joris M. Mooij, Hilbert J. Kappen
IIE
2006
113views more  IIE 2006»
14 years 11 months ago
Gender and Programming Contests: Mitigating Exclusionary Practices
Individuals vary across many dimensions due to the effects of gender-based, personality, and cultural differences. Consequently, programming contests with a limited and rigid stru...
Maryanne Fisher, Anthony Cox
IJON
2006
73views more  IJON 2006»
14 years 11 months ago
Selective attention implemented with dynamic synapses and integrate-and-fire neurons
Selective attention is a process widely used by biological sensory systems to overcome the problem of limited parallel processing capacity: salient subregions of the input stimuli...
Chiara Bartolozzi, Giacomo Indiveri
CORR
2007
Springer
86views Education» more  CORR 2007»
14 years 11 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert