253 search results - page 9 / 51 » Algorithms for the Approximate Common Divisor Problem |
DAGSTUHL
2007
14 years 11 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
103
click to vote
IANDC
2008
14 years 9 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
IPCO
2001
14 years 11 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
CIAC
2010
Springer
15 years 2 months ago
2010
Springer
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...