Sciweavers

460 search results - page 14 / 92
» A Comparison of Functional and Structural Partitioning
Sort
View
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 8 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
ECCV
2000
Springer
14 years 10 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
BMCBI
2005
92views more  BMCBI 2005»
13 years 8 months ago
A decoy set for the thermostable subdomain from chicken villin headpiece, comparison of different free energy estimators
Background: Estimators of free energies are routinely used to judge the quality of protein structural models. As these estimators still present inaccuracies, they are frequently e...
Federico Fogolari, Silvio C. E. Tosatto, Giorgio C...
ICSM
2005
IEEE
14 years 2 months ago
Comparison of Clustering Algorithms in the Context of Software Evolution
To aid software analysis and maintenance tasks, a number of software clustering algorithms have been proposed to automatically partition a software system into meaningful subsyste...
Jingwei Wu, Ahmed E. Hassan, Richard C. Holt
ACL2
2006
ACM
14 years 2 months ago
Function memoization and unique object representation for ACL2 functions
We have developed an extension of ACL2 that includes the implementation of hash-based association lists and function memoization; this makes some algorithms execute more quickly. ...
Robert S. Boyer, Warren A. Hunt Jr.