Sciweavers

1369 search results - page 46 / 274
» Lattice computations for random numbers
Sort
View
RANDOM
1998
Springer
14 years 1 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
CEE
2007
67views more  CEE 2007»
13 years 8 months ago
Turbo equalization for block fading MIMO channels using random signal mapping
We present a novel turbo equalization scheme for block fading MIMO channels, where diversity is achieved using random signal mapping. We show that the computational complexity of ...
Richard Demo Souza, Javier Garcia-Frias, Renato da...
KELSI
2004
Springer
14 years 2 months ago
A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dav...
JCB
2006
91views more  JCB 2006»
13 years 8 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
14 years 3 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang