Sciweavers

73 search results - page 9 / 15
» Fast Monte Carlo Algorithms for Permutation Groups
Sort
View
ISPD
2012
ACM
248views Hardware» more  ISPD 2012»
12 years 3 months ago
A fast estimation of SRAM failure rate using probability collectives
Importance sampling is a popular approach to estimate rare event failures of SRAM cells. We propose to improve importance sampling by probability collectives. First, we use “Kul...
Fang Gong, Sina Basir-Kazeruni, Lara Dolecek, Lei ...
CVPR
2001
IEEE
14 years 9 months ago
A Nonparametric Statistical Comparison of Principal Component and Linear Discriminant Subspaces for Face Recognition
The FERET evaluation compared recognition rates for different semi-automated and automated face recognition algorithms. We extend FERET by considering when differences in recognit...
J. Ross Beveridge, Kai She, Bruce A. Draper, Geof ...
FOCS
2000
IEEE
13 years 12 months ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
CPHYSICS
2008
79views more  CPHYSICS 2008»
13 years 7 months ago
Atmospheric MUons from PArametric formulas: a fast GEnerator for neutrino telescopes (MUPAGE)
Abstract. Neutrino telescopes are opening new opportunities in observational high energy astrophysics. In these detectors, atmospheric muons from primary cosmic ray interactions in...
G. Carminati, M. Bazzotti, A. Margiotta, M. Spurio
INFFUS
2010
121views more  INFFUS 2010»
13 years 6 months ago
The statistical mechanics of belief sharing in multi-agent systems
- Many exciting, emerging applications require that a group of agents share a coherent view of the world given spatial distribution, incomplete and uncertain sensors, and communica...
Robin Glinton, Katia P. Sycara, David Scerri, Paul...