Fuzzy Shortest Path For Steiner Tree Problem
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 4
Abstract
In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edge. Here, to solve the fuzzy shortest path using a new approach ranking method.
Authors and Affiliations
A. Nagoorgani , A. Mumtaj Begam
Speaker Identification using Row Mean of DCT and Walsh Hadamard Transform
In this paper we propose a unique approach to text dependent speaker identification using transformation techniques such as DCT (Discrete Cosine Transform) and WHT (Walsh and Hadamard Transform). The feature vectors for...
A Simple Algorithm for Detection and Removal of Wormhole Attacks for Secure Routing In Ad Hoc Wireless Networks
The infrastructure of a Mobile Ad hoc Network (MANET) has no routers for routing, and all nodes must share the same routing protocol to assist each other when transmitting messages. However, almost all common routing pro...
WEB-BASED-SECURE ONLINE NONCHOICE –BASED EXAMINATION SYSTEM (WONES) using Cryptography
Web based Online Non-choice-based Examination System (WONES) is an effective solution for mass education evaluation. WONES ensures transactions between the examination server and the candidates by employing special authe...
INTEGRATING INTELLIGENT PREDICTIVE CACHING AND STATIC PREFETCHING IN WEB PROXY SERVERS
time perceived by users. By integrating Web caching and Web prefetching, these two techniques can complement each other since the Web caching technique exploits the temporal locality, whereas Web prefetching technique ut...
FEATURE BASED IMAGE OPTIMIZATION TECHIQUE
The motivation behind the production of high resolution images is to increase the quality and the visual presentation of a digital image. The erstwhile analogue images captured by the silver Bromide film was having infin...