12265 search results - page 83 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
ERSHOV
2009
Springer
14 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
MYCRYPT
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
FOCS
1990
IEEE
14 years 2 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.