Sciweavers

11097 search results - page 1879 / 2220
» Hera presentation generator
Sort
View
ISCI
1998
82views more  ISCI 1998»
15 years 7 months ago
The ParaStation Project: Using Workstations as Building Blocks for Parallel Computing
The ParaStation communication fabric provides a high-speed communicationnetwork with user-levelaccess to enable e cientparallel computing on workstation clusters. The architecture...
Thomas M. Warschko, Joachim M. Blum, Walter F. Tic...
JMLR
2002
117views more  JMLR 2002»
15 years 7 months ago
Learning to Construct Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
JOC
2002
99views more  JOC 2002»
15 years 7 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
218
Voted
JMIV
1998
93views more  JMIV 1998»
15 years 7 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 7 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
« Prev « First page 1879 / 2220 Last » Next »