Sciweavers

1612 search results - page 280 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICPP
2006
IEEE
15 years 3 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
SPAA
2003
ACM
15 years 3 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
HPDC
2010
IEEE
14 years 10 months ago
MPIPairwiseStatSig: parallel pairwise statistical significance estimation of local sequence alignment
Sequence comparison is considered as a cornerstone application in bioinformatics, which forms the basis of many other applications. In particular, pairwise sequence alignment is a...
Ankit Agrawal, Sanchit Misra, Daniel Honbo, Alok N...
WWW
2005
ACM
15 years 10 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
BMCBI
2008
153views more  BMCBI 2008»
14 years 9 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani