Combining Speedup Techniques based on Landmarks and Containers
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 6
Abstract
The Dijkstra’s algorithm [1] , which is applied in many real world problems like mobile routing, road maps, railway networks, etc,. is used to find the shortest path between source and destination. There are many techniques available to speedup the algorithm while guaranteeing the optimality of the solution. The main focus of the work is to implement landmark technique and Containers separately and compare the results with random graphs and planar graphs. The combined speedup technique which is based on landmarks and containers were also experimented with random graphs and planar graphs to improve the speedup of the shortest path queries.
Authors and Affiliations
R. KALPANA , Dr. P. THAMBIDURAI
Superresolution: A Novel Application to Image Restoration
The subject of extracting particular high-resolution data from low-resolution images is one of the most important digital image processing applications in recent years, attracting much research. This paper shows how to i...
Emerging Requirements Of Reconfigurable Computing Systems For Performance Enhancement
The reconfigurable computing is intended to fill the gap etween the non-flexible but high speed application specific integrated circuits based technology and the mostflexible but slow speed general purpose processor bas...
Method for forecasting the volume of applications using probabilistic classifier based on Bayesian theorem for recruitment in the government organizations
In this paper, we propose a practical method to estimate or forecast the volume of applications based on Bayesian classifier which is a probability method that makes optimal decision based on known probability distributi...
Palmprint Recognition in Eigen-space
This paper proposes a novel technique for palmprint recognition in context to biometric identification of a person. Palmprints are images of the inner portion of a person’s palm and consist of a complex pattern of random...
Quantum computation and Biological stress: A Hypothesis
We propose that biological systems may behave as quantum computers.We have earlier hypothesized that patterns of quantum computation may be altered in stress and this leads to the change in the consciousness vector of bi...