Results 1  10
of
1,887,425
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 285 (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 101 (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 81 (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
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 633 (5 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
Adhoc OnDemand Distance Vector Routing
 IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
, 1997
"... An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such adhoc n ..."
Abstract

Cited by 3167 (15 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad
Distance Metric Learning, With Application To Clustering With SideInformation
 ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 15
, 2003
"... Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many "plausible" ways, and if a clustering algorithm such as Kmeans initially fails to find one that is meaningful to a user, the only recourse may be for the us ..."
Abstract

Cited by 799 (14 self)
 Add to MetaCart
examples. In this paper, we present an algorithm that, given examples of similar (and, if desired, dissimilar) pairs of points in R , learns a distance metric over R that respects these relationships. Our method is based on posing metric learning as a convex optimization problem, which allows us
Distance Vector Multicast Routing Protocol
 RFC 1075, BBN
, 1988
"... This RFC describes a distancevectorstyle routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP) [1], and implements multicasting as described in RFC1054. This is an experimental protocol, and its implementation is not recomm ..."
Abstract

Cited by 477 (3 self)
 Add to MetaCart
This RFC describes a distancevectorstyle routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP) [1], and implements multicasting as described in RFC1054. This is an experimental protocol, and its implementation
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
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
Results 1  10
of
1,887,425