Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

90 results for “Computation algorithm”
Set a search alert
Research ArticleOpen accessIn the abstractEfficient Star Topology based Multicast Key Management AlgorithmK. Saravanan, T. PurusothamanProblem statement: Secure group communication is very important for many applications such as internet pay sites. It provides efficient delivery of identical data to only the customers in the group. In large and dynamic multicast groups, the group keys of members have to be changed frequently whenever the member leaves or joins. A common method is to apply a symmetric … …Journal of Computer Science, Vol. 8, Issue 6 · 22 Mar 2012 · 7,350 accessesView PDFCite
Research ArticleOpen accessIn the abstractPrivacy Preserved Collaborative Secure Multiparty Data MiningM. Balamurugan, J. Bhuvana, S. Chenthur PandianProblem statement: In the current modern business environment, its success is defined by collaboration, team efforts and partnership, rather than lonely spectacular individual efforts in isolation. So the collaboration becomes especially important because of the mutual benefit it brings. Sometimes, such collaboration even occurs among competitors, or among companies that have conflict of interests, but the collaborators are aware that … …Journal of Computer Science, Vol. 8, Issue 6 · 16 Mar 2012 · 7,164 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Algorithm for Fractal Coding Using Self Organizing MapS. Bhavani, k. ThanushkodiProblem statement: In medical imaging, lossy compression schemes are generally not used due to possible loss of useful clinical information and also degradations may result in lossy compression owing to operations like enhancement. As the medical images are huge in size a good lossy compression technology is required to store them in medical archives in an economical manner. There is … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 7,588 accessesView PDFCite
Research ArticleOpen accessIn the abstractComputation of Private Key Based on Divide-By-Prime for Luc CryptosystemsZulkarnain Md Ali, Nawara Makhzoum Alhassan MakhzoumProblem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original … …Journal of Computer Science, Vol. 8, Issue 4 · 1 Feb 2012 · 7,069 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Effective Contributory Re-Keying Approach to Compute Conference KeyD. Thilagavathy, M. RajaramProblem statement: With the explosive growth of and internet and web applications many emerging group-oriented distributed applications such as tele/video-conferencing, multiplayer games are based on group communication model that need security services such as privacy and data integrity Hence a secure distributed group key agreement is required to establish and authenticate a common group key for secure and private communication. … …Journal of Computer Science, Vol. 7, Issue 8 · 15 Jul 2011 · 6,646 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Approach to Medical Image SegmentationNandagopalan Shanmugam, Adiga B. Suryanarayana, Sudarshan TSB et al.Problem statement: Segmentation is a vital aspect of medical imaging. It aids in the visualization of medical data and diagnostics of various diseases. Ultrasound image segmentation, in particular echocardiographic image segmentation, is required to identify the regions of interest such as Left Ventricle (LV) and other cardiac cavities. Existing methods do not address the drawbacks of speed and quality of … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,216 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplication of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic ConditionsSupat PatvichaichodProblem statement: This study deals with the pickup and delivery traveling salesman problem with traffic conditions (PDTSPTW), an extension of the pickup and delivery traveling salesman problem (PDTSP) where each customer to be served is associated with two quantities of product to be collected and delivered. Almost PDTSP problems uses distance between each point of customers as Euclidean Distance and … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,781 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,820 accessesView PDFCite
Research ArticleOpen accessIn the abstractImproving Computation Power by Reducing Query Response Time in Peer-to-Peer EnvironmentVelvizhi Nandagopal, D. ManjulaProblem statement: The Peer-to-Peer (P2P) was an emerging model and was being widely adopted in today’s internet computing.P2P traffic contributes the largest portion of the internet traffic which was unnecessary and led to delay. In existing Scalable Bipartite Overlay (SBO) network, Out of “N” peers, one group of peers were probing the messages (or) queries whereas the other group of … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,601 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,621 accessesView PDFCite