The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The transmission of Voice over Internet protocol requires signal processing for reliable & efficient performance over the computer and the communication platform. Speech quality, as perceived by the users of VoIP telephony, is critically important to the update of the service. Signal quality is degraded by network layer problems including delay, jitter and packet loss. The work presented in this...
In this paper we present a sorting algorithm, which uses the methodology of insertion sort efficiently to give a much better performance than the existing sorting algorithms of the O(n2 ) class. We prove the correctness of the algorithm and give a detailed time complexity analysis of the algorithm. We also describe various applications of the algorithms.
It is known that insertion sort performs better on almost sorted arrays than other O(n2 ) sorting algorithms. In this paper we develop a bi-partitioned insertion algorithm for sorting, which out beats all other O(n2 ) sorting algorithms in general cases. The graphs of total time taken by different sorting algorithms confirm the superiority of our algorithm over other existing similar algorithms. We...
Sorting is a very well known problem in computer science. It means arranging the data in either increasing or decreasing order. Here we present a new comparison based sorting algorithm whose complexity is theoretically shown to be O(n2).However graphs of total time taken by different sorting algorithms confirms the superiority of our algorithm over other existing similar algorithms. We have also proved...
This paper presents a novel algorithm for automatic facial feature extraction from 3D facial data. The proposed algorithm is found to be pose and expression invariant. It is successfully tested on 3D face database from the State University of New York, Binghamton, USA. In order to test the algorithm, the images have been regenerated using these extracted features. Bezier surface algorithm has been...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.