1369 search results - page 114 / 274 » Lattice computations for random numbers |
ECSQARU
2009
Springer
14 years 3 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
ICIP
2008
IEEE
14 years 3 months ago
2008
IEEE
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
FSTTCS
1995
Springer
14 years 18 days ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We investigate in this paper the performance of a file sharing principle similar to the one implemented by eMule. For this purpose, we consider a system composed of N peers becomi...