Sciweavers

5115 search results - page 95 / 1023
» On Randomized Lanczos Algorithms
Sort
View
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
14 years 12 months ago
Permutations Without Long Decreasing Subsequences and Random Matrices
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
Piotr Sniady
EUROCRYPT
2004
Springer
15 years 5 months ago
Construction of Secure Random Curves of Genus 2 over Prime Fields
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
Pierrick Gaudry, Éric Schost
CSR
2006
Springer
15 years 3 months ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu
EMMCVPR
2001
Springer
15 years 4 months ago
Relaxing Symmetric Multiple Windows Stereo Using Markov Random Fields
This paper introduces R-SMW, a new algorithm for stereo
Andrea Fusiello, Umberto Castellani, Vittorio Muri...
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 12 months ago
Tensor sparsification via a bound on the spectral norm of random tensors
Given an order-d tensor A Rn
Nam H. Nguyen, Petros Drineas, Trac D. Tran