Results 241 to 250 of about 1,575,789 (284)
Some of the next articles are maybe not open access.
Fast automatic inharmonicity estimation algorithm
The Journal of the Acoustical Society of America, 2007A new algorithm is presented for estimating the inharmonicity coefficient of slightly inharmonic stringed instrument sounds. In the proposed partial frequencies deviation method, the inharmonicity is estimated in an intuitive way by minimizing the deviation of the expected partial frequencies compared to the frequencies of the high amplitude peaks in ...
Jukka, Rauhala +2 more
openaire +2 more sources
A FAST Pattern Matching Algorithm
Journal of Chemical Information and Computer Sciences, 2004The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the
Sheik, SS +4 more
openaire +2 more sources
Fast Algorithms for Approximating Distances
Algorithmica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bespamyatnikh, S., Segal, M.
openaire +1 more source
International Journal of Pattern Recognition and Artificial Intelligence, 2002
A fast support vector machine (SVM) training algorithm is proposed under SVM's decomposition framework by effectively integrating kernel caching, digest and shrinking policies and stopping conditions. Kernel caching plays a key role in reducing the number of kernel evaluations by maximal reusage of cached kernel elements.
Jian-xiong Dong +2 more
openaire +1 more source
A fast support vector machine (SVM) training algorithm is proposed under SVM's decomposition framework by effectively integrating kernel caching, digest and shrinking policies and stopping conditions. Kernel caching plays a key role in reducing the number of kernel evaluations by maximal reusage of cached kernel elements.
Jian-xiong Dong +2 more
openaire +1 more source
Fast Transversal Rls Algorithms
1997Among the large number of algorithms that solve the least-squares problem in a recursive form, the fast transversal recursive least-squares (FTRLS) algorithms are very attractive due to their reduced computational complexity [1]–[7].
openaire +1 more source
13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior.
openaire +1 more source
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior.
openaire +1 more source
Fast JPDA multitarget tracking algorithm
Applied Optics, 1989Multitarget tracking requires assigning probabilities that measurements are associated with particular targets. A new and efficient algorithm to achieve this is detailed. Its implementation on an analog optical processor using a new and cost-effective frequency-multiplexing technique is discussed.
J L, Fisher, D P, Casasent
openaire +2 more sources
1981
The main objective of this chapter is to focus attention on fast algorithms for the summation of lagged products. Such problems are very common in physics and are usually related to the computation of digital filtering processes, convolutions, and correlations.
openaire +1 more source
The main objective of this chapter is to focus attention on fast algorithms for the summation of lagged products. Such problems are very common in physics and are usually related to the computation of digital filtering processes, convolutions, and correlations.
openaire +1 more source
Fast Algorithms for Classical Physics
Science, 1994Some of the recently developed fast summation methods that have arisen in scientific computing are described. These methods require an amount of work proportional to N or N log N to evaluate all pairwise interactions in an ensemble of N ...
openaire +2 more sources