Results 1  10
of
21,310
Improved heterogeneous distance functions
 Journal of Artificial Intelligence Research
, 1997
"... Instancebased learning techniques typically handle continuous and linear input values well, but often do not handle nominal input attributes appropriately. The Value Difference Metric (VDM) was designed to find reasonable distance values between nominal attribute values, but it largely ignores cont ..."
Abstract

Cited by 290 (9 self)
 Add to MetaCart
continuous attributes, requiring discretization to map continuous values into nominal values. This paper proposes three new heterogeneous distance functions, called the Heterogeneous Value Difference Metric (HVDM), the Interpolated Value Difference Metric (IVDM), and the Windowed Value Difference Metric
Reconciling Distance Functions and Level Sets
 Journal of Visual Communication and Image Representation
, 1999
"... This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher an ..."
Abstract

Cited by 100 (9 self)
 Add to MetaCart
This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher
LOCAL DIFFERENTIABILITY OF DISTANCE FUNCTIONS
 TRANSACTIONS OF THE AMER. MATH. SOCIETY
, 1999
"... Recently Clarke, Stern and Wolenski characterized, in a Hilbert space, the closed subsets C for which the distance function dC is continuously differentiable everywhere on an open “tube” of uniform thickness around C. Here a corresponding local theory is developed for the property of dC being contin ..."
Abstract

Cited by 83 (5 self)
 Add to MetaCart
Recently Clarke, Stern and Wolenski characterized, in a Hilbert space, the closed subsets C for which the distance function dC is continuously differentiable everywhere on an open “tube” of uniform thickness around C. Here a corresponding local theory is developed for the property of dC being
Level Sets and Distance Functions
 Proc. of the Europ. Conf. on Comp. Vis., volume 1842 of LNCS
, 2000
"... This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher an ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher
Generalized distance functions
 In Proceedings of the International Conference on Shape Modeling and Applications
, 1999
"... In this paper, we obtain a generalized version of the wellknown distance function family Lp norm. We prove that the new functions satisfy distance function properties. By using these functions, convex symmetric shapes can be described as loci, the set of points which are in equal distance from a giv ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper, we obtain a generalized version of the wellknown distance function family Lp norm. We prove that the new functions satisfy distance function properties. By using these functions, convex symmetric shapes can be described as loci, the set of points which are in equal distance from a
HamiltonJacobi equations and distance functions . ..
, 2002
"... The paper is concerned with the properties of the distance function from a closed subset of a Riemannian manifold, with particular attention to the set of singularities. ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
The paper is concerned with the properties of the distance function from a closed subset of a Riemannian manifold, with particular attention to the set of singularities.
Infeasibilities and Directional Distance Functions
, 2006
"... The purpose of this contribution is to highlight an underexplored property of the directional distance function, a recently introduced generalization of the Shephardian distance function. It diagnoses in detail the economic conditions under which infeasibilities may occur for the case of directional ..."
Abstract
 Add to MetaCart
The purpose of this contribution is to highlight an underexplored property of the directional distance function, a recently introduced generalization of the Shephardian distance function. It diagnoses in detail the economic conditions under which infeasibilities may occur for the case
A remark on computing distance functions
 J. Comput. Phys
"... We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput. Phy ..."
Abstract

Cited by 80 (5 self)
 Add to MetaCart
We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract

Cited by 534 (8 self)
 Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance
ON THE COMPUTATION OF EDIT DISTANCE FUNCTIONS
"... Abstract. The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The edit distance function of hereditary property, H, is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H. This p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The edit distance function of hereditary property, H, is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H
Results 1  10
of
21,310