Sciweavers

1154 search results - page 23 / 231
» On the editing distance of graphs
Sort
View
COMBINATORICS
2000
138views more  COMBINATORICS 2000»
13 years 8 months ago
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
Miguel Angel Fiol
ICPR
2002
IEEE
14 years 9 months ago
An Evaluation of the WPE Algorithm Using Tangent Distance
Weighting Prototype Editing (WPE) is a novel approach to edit a given set of prototypes so that the resulting set can outperform the original one in terms of the Nearest Neighbor ...
Roberto Paredes Palacios, Enrique Vidal, Daniel Ke...
ICALP
2001
Springer
14 years 1 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
SIGMOD
2005
ACM
113views Database» more  SIGMOD 2005»
14 years 2 months ago
Robust and Fast Similarity Search for Moving Object Trajectories
An important consideration in similarity-based retrieval of moving object trajectories is the definition of a distance function. The existing distance functions are usually sensi...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 11 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...