Sciweavers

22 search results - page 3 / 5
» An O(M(n) log n) algorithm for the Jacobi symbol
Sort
View
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
BIRTHDAY
2010
Springer
13 years 8 months ago
Transposition and Time-Scale Invariant Geometric Music Retrieval
Abstract. This paper considers how to adapt geometric algorithms, developed for content-based music retrieval of symbolically encoded music, to be robust against time deformations ...
Kjell Lemström
ICCAD
1997
IEEE
126views Hardware» more  ICCAD 1997»
14 years 3 hour ago
An output encoding problem and a solution technique
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...
Subhasish Mitra, LaNae J. Avra, Edward J. McCluske...
JCSS
2010
190views more  JCSS 2010»
13 years 6 months ago
Pattern matching with don't cares and few errors
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Raphaël Clifford, Klim Efremenko, Ely Porat, ...
ALT
1997
Springer
13 years 11 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...