Sciweavers

699 search results - page 3 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
JCC
2002
127views more  JCC 2002»
13 years 7 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
JAPLL
2008
121views more  JAPLL 2008»
13 years 7 months ago
Reasoning with prioritized information by iterative aggregation of distance functions
We introduce a general framework for reasoning with prioritized propositional data by aggregation of distance functions. Our formalism is based on a possible world semantics, wher...
Ofer Arieli
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
14 years 1 months ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 7 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 7 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...