207 search results - page 15 / 42 » The Polynomial Method for Random Matrices |
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
ISBI
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we propose a classification-based method towards the segmentation of diffusion tensor images. We use Support Vector Machines to classify diffusion tensors and we ex...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
STACS
2001
Springer
14 years 27 days ago
2001
Springer
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...