Sciweavers

2745 search results - page 9 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICIP
2000
IEEE
14 years 9 months ago
A Fast Hierarchical Algorithm of Maximum Intensity Projection
The maximum intensity projection (MIP) is a useful tool to visualize 3D images. The processing time of the MIP depends on the number of voxels of the 3D data. Therefore, it is ver...
Keun Ho Kim, Min Jeong Kwon, Hyun Wook Park
PPOPP
2012
ACM
12 years 2 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
CG
2007
Springer
13 years 7 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
CVPR
2012
IEEE
11 years 9 months ago
FREAK: Fast Retina Keypoint
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
Alexandre Alahi, Raphael Ortiz, Pierre Vandergheyn...
BMCBI
2010
175views more  BMCBI 2010»
13 years 7 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng