A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms

Eva Gómez-Ballester, Luisa Micó, José Oncina. A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms. In Niels da Vitoria Lobo, Takis Kasparis, Fabio Roli, James Tin-Yau Kwok, Michael Georgiopoulos, Georgios C. Anagnostopoulos, Marco Loog, editors, Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008. Proceedings. Volume 5342 of Lecture Notes in Computer Science, pages 926-936, Springer, 2008. [doi]

@inproceedings{Gomez-BallesterMO08,
  title = {A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms},
  author = {Eva Gómez-Ballester and Luisa Micó and José Oncina},
  year = {2008},
  doi = {10.1007/978-3-540-89689-0_96},
  url = {http://dx.doi.org/10.1007/978-3-540-89689-0_96},
  tags = {rule-based, rules, search},
  researchr = {https://researchr.org/publication/Gomez-BallesterMO08},
  cites = {0},
  citedby = {0},
  pages = {926-936},
  booktitle = {Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008. Proceedings},
  editor = {Niels da Vitoria Lobo and Takis Kasparis and Fabio Roli and James Tin-Yau Kwok and Michael Georgiopoulos and Georgios C. Anagnostopoulos and Marco Loog},
  volume = {5342},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-89688-3},
}