6437 search results - page 132 / 1288 » Parallel Algorithms for Arrangements |
75
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
102
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
123
click to vote
PC
2002
15 years 12 days ago
2002
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
101
click to vote
CASES
2009
ACM
15 years 7 months ago
2009
ACM
Solid State Disks (SSDs) are superior to magnetic disks from a performance point of view due to the favorable features of NAND flash memory. Furthermore, thanks to improvement on...
118
Voted
BMCBI
2008
15 years 26 days ago
2008
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...