10988 search results - page 201 / 2198 » Algorithmic Folding Complexity |
117
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
103
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
162
Voted
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
137
Voted
STOC
1996
ACM
15 years 7 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
108
Voted
DAGSTUHL
2008
15 years 5 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...