Sciweavers

1029 search results - page 26 / 206
» Probabilistic Recurrence Relations
Sort
View
99
Voted
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
15 years 4 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
SNPD
2003
14 years 11 months ago
Stream Processing on the Grid: an Array Stream Transforming Language
Specific requirements of stream processing on the Grid are discussed. We argue that when the stream processing paradigm is used for cluster computing, the processing components c...
Alexander V. Shafarenko
MOC
1998
107views more  MOC 1998»
14 years 9 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
148
Voted
TOMACS
2011
139views more  TOMACS 2011»
14 years 5 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
AAAI
2012
13 years 16 days ago
Supervised Probabilistic Robust Embedding with Sparse Noise
Many noise models do not faithfully reflect the noise processes introduced during data collection in many real-world applications. In particular, we argue that a type of noise re...
Yu Zhang, Dit-Yan Yeung, Eric P. Xing