Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Lewenstein, Noa"'
Jumbled indexing is the problem of indexing a text $T$ for queries that ask whether there is a substring of $T$ matching a pattern represented as a Parikh vector, i.e., the vector of frequency counts for each character. Jumbled indexing has garnered
Externí odkaz:
http://arxiv.org/abs/1405.0189
Autor:
Amir, Amihood, Franceschini, Gianni, Grossi, Roberto, Kopelowitz, Tsvi, Lewenstein, Moshe, Lewenstein, Noa
This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is
Externí odkaz:
http://arxiv.org/abs/1306.0406
Autor:
Butman, Ayelet, Clifford, Peter, Clifford, Raphael, Jalsenius, Markus, Lewenstein, Noa, Porat, Benny, Porat, Ely, Sach, Benjamin
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing where applicat
Externí odkaz:
http://arxiv.org/abs/1109.1494
Autor:
Amir, Amihood, Apostolico, Alberto, Hirst, Tirza, Landau, Gad M., Lewenstein, Noa, Rozenberg, Liat
Publikováno v:
In Theoretical Computer Science 20 December 2016 656 Part B:146-159
Publikováno v:
In Theoretical Computer Science 25 July 2016 638:27-32
Publikováno v:
In Theoretical Computer Science 8 May 2014 533:26-36
Autor:
Amir, Amihood, Apostolico, Alberto, Eisenberg, Estrella, Landau, Gad M., Levy, Avivit, Lewenstein, Noa
Publikováno v:
In Theoretical Computer Science 13 March 2014 525:60-67
Publikováno v:
In Journal of Algorithms November 2000 37(2):247-266
Autor:
Amir, Amihood, Keselman, Dmitry, Landau, Gad M., Lewenstein, Moshe, Lewenstein, Noa, Rodeh, Michael
Publikováno v:
In Journal of Algorithms November 2000 37(2):309-325
Publikováno v:
In Journal of Algorithms April 2000 35(1):82-99