Sciweavers

308 search results - page 23 / 62
» Fast Comparisons of Circuit Implementations
Sort
View
JCC
2008
117views more  JCC 2008»
14 years 11 months ago
FACTS: Fast analytical continuum treatment of solvation
: An efficient method for calculating the free energy of solvation of a (macro)molecule embedded in a continuum solvent is presented. It is based on the fully analytical evaluation...
Urs Haberthür, Amedeo Caflisch
TVCG
2010
141views more  TVCG 2010»
14 years 10 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
16 years 6 days ago
Design Of Provably Correct Storage Arrays
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
Rajiv V. Joshi, Wei Hwang, Andreas Kuehlmann
VCIP
2003
178views Communications» more  VCIP 2003»
15 years 1 months ago
Geometrical image compression with bandelets
This paper introduces a new class of bases, called bandelet bases, which decompose the image along multiscale vectors that are elongated in the direction of a geometric flow. Thi...
Erwan Le Pennec, Stéphane Mallat
BMCBI
2007
136views more  BMCBI 2007»
14 years 12 months ago
Comparison of protein structures by growing neighborhood alignments
Background: Design of protein structure comparison algorithm is an important research issue, having far reaching implications. In this article, we describe a protein structure com...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...