Sciweavers

492 search results - page 54 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
STTT
2008
90views more  STTT 2008»
14 years 11 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier
IPPS
2009
IEEE
15 years 5 months ago
Singular value decomposition on GPU using CUDA
Linear algebra algorithms are fundamental to many computing applications. Modern GPUs are suited for many general purpose processing tasks and have emerged as inexpensive high per...
Sheetal Lahabar, P. J. Narayanan
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 4 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 2 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
ICALP
1992
Springer
15 years 3 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao