Author image not provided
 Rinat Ben Avraham

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.50
Citation Count6
Publication count4
Publication years2010-2015
Available for download4
Average downloads per article93.50
Downloads (cumulative)374
Downloads (12 Months)55
Downloads (6 Weeks)4
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


4 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 4 of 4
Sort by:

1 published by ACM
April 2015 ACM Transactions on Algorithms (TALG): Volume 11 Issue 4, June 2015
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Downloads (Overall): 103

Full text available: PDFPDF
The Fréchet distance is a well-studied similarity measure between curves. The discrete Fréchet distance is an analogous similarity measure, defined for two sequences of m and n points, where the points are usually sampled from input curves. We consider a variant, called the discrete Fréchet distance with shortcuts , which ...
Keywords: approximate distance selection and counting, geometric optimization, Discrete Fréchet distance, curve matching, outliers, shortcuts

2 published by ACM
June 2014 SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 81

Full text available: PDFPDF
The Fréchet distance is a well studied similarity measure between curves. The discrete Fréchet distance is an analogous similarity measure, defined for two sequences of m and n points, where the points are usually sampled from input curves. We consider a variant, called the discrete Fréchet distance with shortcuts, which ...
Keywords: outliers, shortcuts, approximate distance selection and counting, geometric optimization, Discrete Fréchet distance, curve matching

3
January 2013 SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 8,   Downloads (12 Months): 13,   Downloads (Overall): 29

Full text available: PDFPDF
The Fréchet distance is a similarity measure between two curves A and B that takes into account the location and ordering of the points along the two curves: Informally, it is the minimum length of a leash required to connect a dog, walking along A , and its owner, walking ...

4 published by ACM
June 2010 SoCG '10: Proceedings of the twenty-sixth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 138

Full text available: PDFPDF
Let P be a set of n points in ℜ 3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P . We present two randomized algorithms for computing a 2-center of P . The first algorithm runs in O ...
Keywords: spherical polytopes, multi-dimensional parametric searching, intersection of congruent balls, 2-center problem, facility location, geometric optimization



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us