Zobrazeno 1 - 8
of 8
pro vyhledávání: '"İleri, Atalay Mert"'
Over the past two decades, the Web Ontology Language (OWL) has been instrumental in advancing the development of ontologies and knowledge graphs, providing a structured framework that enhances the semantic integration of data. However, the reliabilit
Externí odkaz:
http://arxiv.org/abs/2412.08739
Database research has always given limited attention to optimizing predicates with disjunctions. What little past work there is, has mostly focused on optimizations for traditional row-oriented databases. However, a key difference between how row-ori
Externí odkaz:
http://arxiv.org/abs/2002.00540
Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study the proble
Externí odkaz:
http://arxiv.org/abs/1501.06259
We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal $O(n)$ time and space algorithm that can find an SUS for every location of a string of size $n$. Our algorithm significantly improves th
Externí odkaz:
http://arxiv.org/abs/1312.2738
Publikováno v:
In Theoretical Computer Science 11 January 2015 562:621-633
Since its inception, database research has given limited attention to optimizing predicates with disjunctions. For conjunctions, there there exists a "rule-of-thumb" of evaluating predicates in increasing selectivity to minimize unnecessary predicate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::149855874a2687d75985fe6d60ab96b1
http://arxiv.org/abs/2002.00540
http://arxiv.org/abs/2002.00540
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Combinatorial Pattern Matching (9783319075655); 2014, p172-181, 10p