Sciweavers

6105 search results - page 1 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
IPPS
1999
IEEE
13 years 10 months ago
A Parallel Algorithm for Bound-Smoothing
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 ...
Kumar Rajan, Narsingh Deo
ANTS
1998
Springer
107views Algorithms» more  ANTS 1998»
13 years 10 months ago
Bounding Smooth Integers
Daniel J. Bernstein