Results 231 to 240 of about 319,625 (266)
Some of the next articles are maybe not open access.
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 Algorithms forK4Immersion Testing
Journal of Algorithms, 1999Summary: Many useful classes of graphs can in principle be recognized with finite batteries of obstruction tests. One of the most fundamental tests is to determine whether an arbitrary input graph contains \(K_4\) in the immersion order. In this paper, we present for the first time a fast, practical algorithm to accomplish this task. We also extend our
Heather Booth +3 more
openaire +1 more source
Complexity and fast algorithms for multiexponentiations
IEEE Transactions on Computers, 2000In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by K. Pekmestzi (1989) and generalized in this paper.
Vassil S. Dimitrov +2 more
openaire +1 more source
On fast address-lookup algorithms
IEEE Journal on Selected Areas in Communications, 1999The growth of the Internet and its acceptance has sparkled keen interest in the research community in respect to many apparent scaling problems for a large infrastructure based on IP technology. A self-contained problem of considerable practical and theoretical interest is the longest-prefix lookup operation, perceived as one of the decisive ...
Hong-Yi Tzeng, Tony Przygienda
openaire +1 more source
Journal of Algorithms, 1994
The paper presents two new algorithms, the right- and left \(k\)-ary shift algorithms, for the problem of computing the greatest common divisor (GCD) of two given integers. These algorithms are generalizations of the (right-shift) binary and left-shift binary GCD algorithms. For computing the GCD of two \(n\)-bit integers, both algorithms require \(O(n^
openaire +3 more sources
The paper presents two new algorithms, the right- and left \(k\)-ary shift algorithms, for the problem of computing the greatest common divisor (GCD) of two given integers. These algorithms are generalizations of the (right-shift) binary and left-shift binary GCD algorithms. For computing the GCD of two \(n\)-bit integers, both algorithms require \(O(n^
openaire +3 more sources
Fast isodata clustering algorithms
Pattern Recognition, 1992Abstract The computational requirements of any clustering method are identified as the major bottleneck in the effective exploratory data analysis task. Partial sum and nearest neighbouring distance methods are proposed to speed up the K-MEANS clustering algorithm with Euclidean distance norm.
N. B. Venkateswarlu, P. S. V. S. K. Raju
openaire +1 more source
Fast parallel algorithms for cographs
1990In this paper we propose a new way of looking at cographs and show how it affords us a fast parallel recognition algorithm. Additionally, should the graph under investigation be a cograph, our algorithm constructs its unique tree representation. Next, given a cograph along with its tree representation we obtain a fast parallel coloring algorithm ...
Rong Lin, Stephan Olariu
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
International Conference on Acoustics, Speech, and Signal Processing, 2003
A novel fast algorithm for computing a sequence of bit-reversed integers is presented. In finding a mapping function from a sequence of integers to a sequence of their bit-reverse, a recursive approach is taken to overcome the logarithmic factor burdening the standard scheme. The associated constant for the timing factor is shown to be very low even at
openaire +1 more source
A novel fast algorithm for computing a sequence of bit-reversed integers is presented. In finding a mapping function from a sequence of integers to a sequence of their bit-reverse, a recursive approach is taken to overcome the logarithmic factor burdening the standard scheme. The associated constant for the timing factor is shown to be very low even at
openaire +1 more source