• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Thankachan, Sharma V. (13)
    • Ganguly, Arnab (7)
    • Gibney, Daniel (7)
    • Sharma V. Thankachan (6)
    • Sharma, V. (6)
    • The Pennsylvania State University CiteSeerX Archives (6)
    • Gonzalo Navarro (5)
    • Shah, Rahul (5)
    • Stahl, A. (5)
    • Zhang, J. (5)
    •   more
  • 
    Year
  • 
    Medium:
    
    • Online (26)
  • 
    Type:
    
    • Article (23)
    • Miscellaneous (3)
  • 
    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 Page: 1 2 Hits 1 – 20 of 26 1 FM-Index Reveals the Reverse Suffix Array Gibney, Daniel; Thankachan, Sharma V.; Hooshmand, Sahar. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020 BASE Show details 2 FM-Index Reveals the Reverse Suffix Array ... Ganguly, Arnab; Gibney, Daniel; Hooshmand, Sahar. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 3 On the Complexity of BWT-Runs Minimization via Alphabet Reordering ... Bentley, Jason W.; Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 4 Study of central exclusive [Image: see text] production in proton-proton collisions at [Formula: see text] and 13TeV Sirunyan, A. M.; Tumasyan, A.; Adam, W.... In: Eur Phys J C Part Fields (2020) BASE Show details 5 On the Hardness and Inapproximability of Recognizing Wheeler Graphs Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019 BASE Show details 6 On the Hardness and Inapproximability of Recognizing Wheeler Graphs ... Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2019 BASE Show details 7 On the Complexity of BWT-runs Minimization via Alphabet Reordering ... Bentley, Jason; Gibney, Daniel; Thankachan, Sharma V.. - : arXiv, 2019 BASE Show details 8 On the Hardness and Inapproximability of Recognizing Wheeler Graphs ... Gibney, Daniel; Thankachan, Sharma V.. - : arXiv, 2019 BASE Show details 9 Non-Overlapping Indexing - Cache Obliviously Hooshmand, Sahar; Abedin, Paniz; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018 BASE Show details 10 Structural Pattern Matching - Succinctly Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017 BASE Show details 11 Structural Pattern Matching - Succinctly ... Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017 BASE Show details 12 Search for dark matter produced in association with heavy-flavor quark pairs in proton-proton collisions at [Formula: see text] Sirunyan, A. M.; Tumasyan, A.; Adam, W.. - : Springer Berlin Heidelberg, 2017 BASE Show details 13 Space-Time Trade-Offs for the Shortest Unique Substring Problem Ganguly, Arnab; Hon, Wing-Kai; Shah, Rahul. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016 BASE Show details 14 Parameterized Pattern Matching -- Succinctly ... Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : arXiv, 2016 BASE Show details 15 Forbidden Extension Queries Biswas, Sudip; Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. : LIPIcs - Leibniz International Proceedings in Informatics. 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), 2015 Abstract: Document retrieval is one of the most fundamental problem in information retrieval. The objective is to retrieve all documents from a document collection that are relevant to an input pattern. Several variations of this problem such as ranked document retrieval, document listing with two patterns and forbidden patterns have been studied. We introduce the problem of document retrieval with forbidden extensions. Let D={T_1,T_2,.,T_D} be a collection of D string documents of n characters in total, and P^+ and P^- be two query patterns, where P^+ is a proper prefix of P^-. We call P^- as the forbidden extension of the included pattern P^+. A forbidden extension query < P^+,P^- > asks to report all occ documents in D that contains P^+ as a substring, but does not contain P^- as one. A top-k forbidden extension query < P^+,P^-,k > asks to report those k documents among the occ documents that are most relevant to P^+. We present a linear index (in words) with an O(|P^-| + occ) query time for the document listing problem. For the top-k version of the problem, we achieve the following results, when the relevance of a document is based on PageRank: - an O(n) space (in words) index with O(|P^-|log sigma+ k) query time, where sigma is the size of the alphabet from which characters in D are chosen. For constant alphabets, this yields an optimal query time of O(|P^-|+ k). - for any constant epsilon > 0, a |CSA| + |CSA^*| + Dlog frac{n}{D} + O(n) bits index with O(search(P)+ k cdot tsa cdot log ^{2+epsilon} n) query time, where search(P) is the time to find the suffix range of a pattern P, tsa is the time to find suffix (or inverse suffix) array value, and |CSA^*| denotes the maximum of the space needed to store the compressed suffix array CSA of the concatenated text of all documents, or the total space needed to store the individual CSA of each document. Keyword: Data processing Computer science; document retrieval; range queries; succinct data structure; suffix trees URN: urn:nbn:de:0030-drops-56522 URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2015.320 https://drops.dagstuhl.de/opus/volltexte/2015/5652/ BASE Hide details 16 Preventive Audiology: Screening for Hearing Impairment in Children Having Recurrent URTI Sharma, K.; Pannu, M. S.; Arora, A.. - : Springer India, 2015 BASE Show details 17 Ranked document selection J. Ian Munro; Gonzalo Navarro; Rahul Shah... In: http://www.dcc.uchile.cl/~gnavarro/ps/swat14.pdf (2014) BASE Show details 18 New Space/Time Tradeoffs for Top-k Document Retrieval on Sequences Gonzalo Navarro; Sharma V. Thankachan In: http://www.dcc.uchile.cl/~gnavarro/ps/tcs14.pdf (2014) BASE Show details 19 On Entropy-Compressed Text Indexing in External Memory Wing-kai Hon; Rahul Shah; Sharma V. Thankachan... In: http://faculty.cse.tamu.edu/jsv/Papers/HST09externaltextindexing.pdf (2009) BASE Show details 20 A measurement of the charged and neutral B meson lifetimes using fully reconstructed decays Aubert, B.; Boucham, A.; Boutigny, D.... In: International Conference on High-Energy Physics 30 ICHEP 2000 ; http://hal.in2p3.fr/in2p3-00006091 ; International Conference on High-Energy Physics 30 ICHEP 2000, Jul 2000, Osaka, Japan. pp.1-22 (2000) BASE Show details Page: 1 2

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 26 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0