699 search results - page 52 / 140 » Generalized Distance Functions in the Theory of Computation |
JACM
2000
14 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We propose a method for constructing Dempster-Shafer belief functions modeling the trust of a given agent (the evaluator) in another (the target) by combining statistical informat...
108
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
ICIP
2003
IEEE
15 years 3 months ago
2003
IEEE
We propose to use approximations of shape metrics, such as the Hausdorff distance, to define similarity measures between shapes. Our approximations being continuous and different...
BMCBI
2010
14 years 10 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...