Results 1  10
of
152,643
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 13236 (32 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
A New Parallel Algorithm for Planarity Testing
, 2003
"... This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif's algorithm. The new algorithm has the same complexity b ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif's algorithm. The new algorithm has the same complexity
A New Parallel Algorithm for Planarity Testing
, 2003
"... This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif’s algorithm. The new algorithm � has � the same complexity bo ..."
Abstract
 Add to MetaCart
This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif’s algorithm. The new algorithm � has � the same complexity
A new Parallel Algorithm for the ParenthesesMatching Problem
, 1997
"... 1 The parenthesesmatching problem is of crucial importance in the construction of expression tree in order to evaluate, for instance, arithmetic expressions. A new parallel algorithm is introduced in this paper to solve the parenthesesmatching problem optimally (in O(log 2 n) parallel time with O( ..."
Abstract
 Add to MetaCart
1 The parenthesesmatching problem is of crucial importance in the construction of expression tree in order to evaluate, for instance, arithmetic expressions. A new parallel algorithm is introduced in this paper to solve the parenthesesmatching problem optimally (in O(log 2 n) parallel time with O
A New Parallel Algorithm For The Maximal Independent Set Problem
, 1989
"... A new parallel algorithm for the maximal independent set problem is constructed. It runs in O(log 4 n) time when implemented on a linear number of EREWprocessors. This is the first deterministic algorithm for the maximal independent set problem (MIS) whose running time is polylogarithmic and whose ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
A new parallel algorithm for the maximal independent set problem is constructed. It runs in O(log 4 n) time when implemented on a linear number of EREWprocessors. This is the first deterministic algorithm for the maximal independent set problem (MIS) whose running time is polylogarithmic and whose
A new parallel algorithm for inverse dynamics
 Int. J. Robotics Research
, 1989
"... This paper proposes a new parallel computational scheme for inverse dynamics based on a new description of the NewtonEuler formulation. This description, which is essentially identical to Kane’s formulation for manipulator dynamics, resolves the task of kinematic and dynamic computations into a set ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper proposes a new parallel computational scheme for inverse dynamics based on a new description of the NewtonEuler formulation. This description, which is essentially identical to Kane’s formulation for manipulator dynamics, resolves the task of kinematic and dynamic computations into a
A New Parallel Algorithm for Generalized LR Parsing
, 1990
"... Tomira's parsing algorithm [Tomira 86], which adapted the LR parsing gorithm to context free grammars, makes use of a breadthfirst strategy to handle LR table conflicts. As the breadthfirst strategy is compatible with parallel processing, we can easily develop a parallel generalized LR parse ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
until all other processes have ended theirs  a strategy that reduces parallel performance. We have developed new parallel parsing algorithm that does not need to wait for shift actions before merging many stacks, using stream cotnmunkation of a concurrent logic programming language called GItC [Ueda
A New Parallel Algorithm For Fast Generation of Discrete Chebyshev Polynomials
"... We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fast we mean that the time complexity of the obtained parallel algorithm is of order O(logn), where n is the degree of the (n+1)st polynomial to be generated, and the number of available processors is a ..."
Abstract
 Add to MetaCart
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fast we mean that the time complexity of the obtained parallel algorithm is of order O(logn), where n is the degree of the (n+1)st polynomial to be generated, and the number of available processors
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
 INTERNATIONAL JOURNAL OF SOFT COMPUTING, MATHEMATICS AND CONTROL (IJSCMC),VOL.2,NO.2,MAY 2013
, 2013
"... Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected weighted graph with n vertices and m edges. This algorithm uses the cluster techniques to red ..."
Abstract
 Add to MetaCart
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected weighted graph with n vertices and m edges. This algorithm uses the cluster techniques
A New Parallel Algorithm For Contact Detection In Finite Element Methods
 in Proc. High Perf. Comput. '96, Soc. Comp. Simulation
, 1996
"... In finiteelement, transient dynamics simulations, physical objects are typically modeled as Lagrangian meshes because the meshes can move and deform with the objects as they undergo stress. In many simulations, such as computations of impacts or explosions, portions of the deforming mesh come in c ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
detection problem is difficult to implement efficiently on parallel computers and has been a bottleneck to achieving high performance on large parallel machines. In this paper we describe a new parallel algorithm for detecting contacts. Our approach differs from previous work in that we use two different
Results 1  10
of
152,643