Sciweavers

78 search results - page 15 / 16
» Massively Parallel Solutions for Molecular Sequence Analysis
Sort
View
TCS
2008
13 years 6 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
ICDCS
2008
IEEE
14 years 24 days ago
Sensor Node Localization Using Uncontrolled Events
Many event-driven localization methods have been proposed as low cost, energy efficient solutions for wireless senor networks. In order to eliminate the requirement of accurately...
Ziguo Zhong, Dan Wang, Tian He
SC
2009
ACM
13 years 11 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
SIAMSC
2008
173views more  SIAMSC 2008»
13 years 6 months ago
A Fast Iterative Method for Eikonal Equations
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
Won-Ki Jeong, Ross T. Whitaker
HPDC
2008
IEEE
13 years 6 months ago
Eliminating the middleman: peer-to-peer dataflow
Efficiently executing large-scale, data-intensive workflows such as Montage must take into account the volume and pattern of communication. When orchestrating data-centric workflo...
Adam Barker, Jon B. Weissman, Jano I. van Hemert