A Fast Algorithm for Finding Strong Starters

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

A Fast Algorithm for Finding Crosswalks using Figure-Ground Segmentation

Urban intersections are the most dangerous parts of a blind person’s travel. Proper alignment is necessary to enter the crosswalk in the right direction and avoid the danger of straying outside the crosswalk. Computer vision is a natural tool for providing such alignment information. However, little work has been done on algorithms for finding crosswalks for the blind, and most of it focuses on...

A Fast Algorithm for Finding Correlation Clusters in Noise Data

Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clustering sheds light on identifying correlation clusters in such a data set. In order to exclude noise points which are usually scattered in a subspace, data points are projected to form dense areas in the subspace that are regarded as...

A fast algorithm for finding junction trees 81 A sufficientlyfast algorithm for finding close to optimal junction trees

Au algorithm is developed for findiug a close to optimal junction tree of a given graph Tile algorithm has a worst case co~nplexity O(ckn~) where a and c are coustants, the nmnber of vertices, and k is largest clique in a juuction tree of G in which this size is mini~nized. The algorithm guarantees that the logarittHn of the size of the state space of the heaviest clique in the junction tree pr...

A New Fast Data Encryption Algorithm (FDE)