Sciweavers

492 search results - page 63 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
123
Voted
TIM
2010
144views Education» more  TIM 2010»
14 years 5 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
81
Voted
CCS
2006
ACM
15 years 2 months ago
Scalable group communication system for scalable trust
Programmers of large-scale trusted systems need tools to simplify tasks such as replicating services or data. Group communication systems achieve this via various flavors of relia...
Krzysztof Ostrowski, Kenneth P. Birman
102
Voted
ASPLOS
2009
ACM
15 years 2 months ago
Accelerating phase unwrapping and affine transformations for optical quadrature microscopy using CUDA
Optical Quadrature Microscopy (OQM) is a process which uses phase data to capture information about the sample being studied. OQM is part of an imaging framework developed by the ...
Perhaad Mistry, Sherman Braganza, David R. Kaeli, ...
88
Voted
CF
2005
ACM
15 years 26 days ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
EUROPAR
2005
Springer
15 years 4 months ago
A Paradigm for Parallel Matrix Algorithms:
A style for programming problems from matrix algebra is developed with a familiar example and new tools, yielding high performance with a couple of surprising exceptions. The under...
David S. Wise, Craig Citro, Joshua Hursey, Fang Li...