2766 search results - page 332 / 554 » Algorithms for trigonometric polynomials |
130
click to vote
AAAI
2000
15 years 6 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
139
click to vote
ESANN
2000
15 years 6 months ago
2000
A parametric procedure for the blind inversion of nonlinear channels is proposed, based on a recent method of blind source separation in nonlinear mixtures. Experiments show that ...
136
click to vote
ICGI
2010
Springer
15 years 5 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
165
click to vote
CONSTRAINTS
2008
15 years 4 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
156
click to vote
DAM
2008
15 years 4 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...