• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Azer, Erfan Sadeqi (4)
    • Ergün, Funda (2)
    • Grigorescu, Elena (2)
    • Khashabi, Daniel (2)
    • Zhou, Samson (2)
    • Alikhani, Malihe (1)
    • Aminnaseri, Moin (1)
    • Bitaab, Marzieh (1)
    • Brahman, Faeze (1)
    • Cohan, Arman (1)
    •   more
  • 
    Year:
    
    • 2020 (1)
    • 2019 (1)
    • 2018 (1)
    • 2017 (1)
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 4 of 4 1 ParsiNLU: A Suite of Language Understanding Challenges for Persian ... Khashabi, Daniel; Cohan, Arman; Shakeri, Siamak. - : arXiv, 2020 BASE Show details 2 On the Possibilities and Limitations of Multi-hop Reasoning Under Linguistic Imperfections ... Khashabi, Daniel; Azer, Erfan Sadeqi; Khot, Tushar. - : arXiv, 2019 BASE Show details 3 Periodicity in Data Streams with Wildcards ... Ergün, Funda; Grigorescu, Elena; Azer, Erfan Sadeqi. - : arXiv, 2018 BASE Show details 4 Streaming Periodicity with Mismatches ... Ergün, Funda; Grigorescu, Elena; Azer, Erfan Sadeqi; Zhou, Samson. - : arXiv, 2017 Abstract: We study the problem of finding all $k$-periods of a length-$n$ string $S$, presented as a data stream. $S$ is said to have $k$-period $p$ if its prefix of length $n-p$ differs from its suffix of length $n-p$ in at most $k$ locations. We give a one-pass streaming algorithm that computes the $k$-periods of a string $S$ using $\text{poly}(k, \log n)$ bits of space, for $k$-periods of length at most $\frac{n}{2}$. We also present a two-pass streaming algorithm that computes $k$-periods of $S$ using $\text{poly}(k, \log n)$ bits of space, regardless of period length. We complement these results with comparable lower bounds. ... Keyword: Data Structures and Algorithms cs.DS; FOS Computer and information sciences URL: https://arxiv.org/abs/1708.04381 https://dx.doi.org/10.48550/arxiv.1708.04381 BASE Hide details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 4 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0