Results 1  10
of
4,814
Geometric Spanner of Objects Under L1 Distance
, 2008
"... Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider the following generalized geometric spanner problem under L1 distance: Given a set of disjoint objects S, find a spanning n ..."
Abstract
 Add to MetaCart
Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider the following generalized geometric spanner problem under L1 distance: Given a set of disjoint objects S, find a spanning
Approximating L1distances between mixture distributions using random projections
, 804
"... We consider the problem of computing L1distances between every pair of probability densities from a given family. We point out that the technique of Cauchy random projections [Ind06] in this context turns into stochastic integrals with respect to Cauchy motion. For piecewiselinear densities these ..."
Abstract
 Add to MetaCart
We consider the problem of computing L1distances between every pair of probability densities from a given family. We point out that the technique of Cauchy random projections [Ind06] in this context turns into stochastic integrals with respect to Cauchy motion. For piecewiselinear densities
Similarity of Color Images
, 1995
"... We describe two new color indexing techniques. The first one is a more robust version of the commonly used color histogram indexing. In the index we store the cumulative color histograms. The L 1 , L 2 , or L1 distance between two cumulative color histograms can be used to define a similarity mea ..."
Abstract

Cited by 495 (2 self)
 Add to MetaCart
We describe two new color indexing techniques. The first one is a more robust version of the commonly used color histogram indexing. In the index we store the cumulative color histograms. The L 1 , L 2 , or L1 distance between two cumulative color histograms can be used to define a similarity
Kmeans clustering of proportional data using L1 distance
, 2008
"... We present a new L1distancebased kmeans clustering algorithm to address the challenge of clustering highdimensional proportional vectors. The new algorithm explicitly incorporates proportionality constraints in the computation of the cluster centroids, resulting in reduced L1 error rates. We com ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a new L1distancebased kmeans clustering algorithm to address the challenge of clustering highdimensional proportional vectors. The new algorithm explicitly incorporates proportionality constraints in the computation of the cluster centroids, resulting in reduced L1 error rates. We
L1DISTANCE FOR ADDITIVE PROCESSES WITH TIMEHOMOGENEOUS LÉVY MEASURES
"... Abstract. We give an explicit bound for the L1distance between two additive processes of local characteristics (fj(·), σ 2(·), νj), j = 1, 2. The cases σ = 0 and σ(·)> 0 are both treated. We allow ν1 and ν2 to be timehomogeneous Lévy measures, possibly with infinite variation. Some examples of ..."
Abstract
 Add to MetaCart
Abstract. We give an explicit bound for the L1distance between two additive processes of local characteristics (fj(·), σ 2(·), νj), j = 1, 2. The cases σ = 0 and σ(·)> 0 are both treated. We allow ν1 and ν2 to be timehomogeneous Lévy measures, possibly with infinite variation. Some examples
On L1distance between first exit times from two regions ∗†
, 2008
"... First exit times from regions and their dependence on variations of boundaries are discussed for diffusion processes. The paper presents an estimate of L1distance between exit times from two regions via expectations of exit times. Abbreviated title: On L1distance between first exit times It is kno ..."
Abstract
 Add to MetaCart
First exit times from regions and their dependence on variations of boundaries are discussed for diffusion processes. The paper presents an estimate of L1distance between exit times from two regions via expectations of exit times. Abbreviated title: On L1distance between first exit times
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2182 (27 self)
 Add to MetaCart
of 500 rbcL sequences with 1,428 base pairs from plant plastids, thus reaching a speed of the same order as some popular distancebased and parsimony algorithms. This new method is implemented in the PHYML program, which is freely available on our web page:
Results 1  10
of
4,814