2766 search results - page 154 / 554 » Algorithms for trigonometric polynomials |
144
Voted
ICA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We proposed recently a new method for separating linearquadratic mixtures of independent real sources, based on parametric identification of a recurrent separating struc...
132
Voted
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
111
Voted
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
131
Voted
RECOMB
1997
Springer
15 years 8 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
144
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...