1383 search results - page 39 / 277 » On the Complexity of the Interlace Polynomial |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
101
click to vote
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
In this paper, we propose a new method for face detection from cluttered images. We use a polynomial neural network (PNN) for separation of face and non-face patterns while the co...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
ICML
1999
IEEE
15 years 11 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...