Sciweavers

9736 search results - page 19 / 1948
» How Fast Can We Compute Products
Sort
View
ISQED
2007
IEEE
372views Hardware» more  ISQED 2007»
15 years 10 months ago
From Finance to Flip Flops: A Study of Fast Quasi-Monte Carlo Methods from Computational Finance Applied to Statistical Circuit
Problems in computational finance share many of the characteristics that challenge us in statistical circuit analysis: high dimensionality, profound nonlinearity, stringent accura...
Amith Singhee, Rob A. Rutenbar
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 4 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
ASIACRYPT
2005
Springer
15 years 10 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
IEEESCC
2007
IEEE
15 years 10 months ago
Intelligent Document Gateway - A Ser vice System Analysis
In today’s fast paced world, it is necessary to process business documents expediently, accurately, and diligently. In other words, processing has to be fast, errors must be pre...
Vikas Krishna, John Bailey, Ana Lelescu
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
15 years 8 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira