A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Deterministic Sparse Suffix Sorting in the Restore Model
[article]
2018
arXiv
pre-print
Preserved Fulltext
Other Versions
Given a text T of length n, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of T in O(c √( n) + m m n ^* n) time with O(m) words ...
of space under the premise that the space of T is rewritable, where m < n is the number of suffixes to be sorted (provided online and arbitrarily), and c is the number of characters with m < c < n that ...
Sparse Suffix Sorting The sparse suffix sorting problem asks for the order of suffixes starting at certain positions in a text T . ...
arXiv:1509.07417v2
fatcat:bxdekvob7bcmxkmyfo3ktaauki
Optimal Substring-Equality Queries with Applications to Sparse Text Indexing
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, we describe the first in-place subquadratic Monte Carlo solutions to the sparse suffix sorting, sparse LCP array construction, and suffix selection problems. ...
This leads to the first Las Vegas in-place algorithm computing the full LCP array in O(nlog n) time and to the first Las Vegas in-place algorithms solving the sparse suffix sorting and sparse LCP array ...
Acknowledgements I would like to thank the anonymous reviewers: their observations greatly improved the presentation of the results, as well as some of the results themselves (in particular, w.h.p. time ...
arXiv:1803.01723v2
fatcat:y375kzudnjfb7n3hj6s7zf4ajq
In-Place Sparse Suffix Sorting
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Such information can be stored space-efficiently (in b words) in the sparse suffix array (SSA). ...
The main reason for using the SSA and SLCP arrays in place of the sparse suffix tree is, however, their reduced space of b words each. ...
Our LCE structure can be directly used to solve in-place the sparse suffix sorting problem. ...
arXiv:1608.05100v11
fatcat:r77zezc7xnexxnnw63uuvwjh34
Sparse Suffix Tree Construction in Optimal Time and Space
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In some applications, we work with a subset of b interesting suffixes, which are stored in the so-called sparse suffix tree. ...
We improve this structure, which implies a linear-time sparse suffix tree construction algorithm. We complement our Monte Carlo algorithm with a deterministic verification procedure. ...
[12] gave an O(n √ log n + b log b log n log * n)-time and O(b)-space deterministic algorithm in a stronger model of rewritable text which needs to be restored before termination. ...
arXiv:1608.00865v1
fatcat:cwarx7dxxncn5fcgpuwejardmu
Parallel external memory graph algorithms
2010
2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. ...
All our solutions on a P -processor PEM model provide an optimal speedup of Θ(P ) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts ...
Acknowledgments We would like to thank Deepak Ajwani for helpful comments in improving the presentation of the ideas in this manuscript. ...
doi:10.1109/ipdps.2010.5470440
dblp:conf/ipps/ArgeGS10
fatcat:ul3phtd5prawdilrojj3mommjm
Optimized sparse polynomial chaos expansion with entropy regularization
2022
Advances in Aerodynamics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
A novel entropy-based optimization method is proposed to update the state-of-the-art sparse PCE models. ...
This work further develops an entropy-based synthetic sparse model, which has higher computational efficiency. ...
In addition, we are grateful to Mingze Qi for his constructive suggestion about paper writing and organization.
Authors' contributions All authors read and approved the final manuscript. ...
doi:10.1186/s42774-021-00095-6
fatcat:d466kezf3fgyrkmpkkcgc6gdda
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
1993
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In contrast, this work is the first to narrow the gap in terms of worst case, deterministic complexity. ...
The planning stage first performs a sparse enumeration sort to calculate the sorted positions of the records in a single level of C. ...
doi:10.1016/0022-0000(93)90043-v
fatcat:nee44zemwffz3hy34zerczv4qq
Algorithms and Data Structures for External Memory
2006
Foundations and Trends® in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
in order to reduce the I/O costs. ...
The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing. ...
is restored. ...
doi:10.1561/0400000014
fatcat:bkfchugd4fbjvcu5zipnh23k6e
Dynamic Packed Compact Tries Revisited
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
It supports all operations in O(m / α + α) expected time on an input string of length m in the word RAM model. ...
Under the assumption that α = w/ σ characters fit into a single machine word of w bits, we propose a keyword dictionary that represents K in either n σ + Θ(k n) or |T| σ + Θ(k w) bits of space, where | ...
Also, with delete and insert operations, one can efficiently maintain the sparse suffix tree [24] for a dynamic set of suffixes to index. ...
arXiv:1904.07467v2
fatcat:7fic6poagbgshjtnxrlsiv2hji
Correcting Diacritics and Typos with a ByT5 Transformer Model
2022
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our approach is also able to restore diacritics in words not seen during training with >76% accuracy. ...
with all the diacritics missing.In this work, we tackle both problems at once by employing the newly-developed universal ByT5 byte-level seq2seq transformer model that requires no language-specific model ...
The authors in [11] use the lemmatization technique to restore diacritics for the Czech language. Their method contains the set of if-then rules that consider prefixes and suffixes. ...
doi:10.3390/app12052636
fatcat:relakw7ovff63oxsudtj2oyyk4
External memory algorithms and data structures: dealing with massive data
2001
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paradigm of disk striping offers an elegant way to use multiple disks in parallel. For sorting, however, ...
In this article we survey the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs ...
ACKNOWLEDGMENTS The author wishes to thank Pankaj Agarwal, Lars Arge, Ricardo Baeza-Yates, Adam Buchsbaum, Jeff Chase, David Hutchinson, Vasilis Samoladas, Amin Vahdat, the members of the Center for Geometric ...
doi:10.1145/384192.384193
fatcat:tunz4fa3rrgv7hwbk7qsvahd5i
Restoring Arabic vowels through omission-tolerant dictionary lookup
2019
Language Resources and Evaluation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For restoring vowels, our resources are capable of identifying words in which the vowels are not shown, as well as words in which the vowels are partially or fully included. ...
Although numerous studies have been published on the issue of restoring the omitted vowels in speech technologies, little attention has been given to this problem in papers dedicated to written Arabic ...
Words in a text are sorted; then the sorted list of word types (agglutinated or not) are labelled and presented to the user. ...
doi:10.1007/s10579-019-09464-6
fatcat:chdbye2d55fhxdvvbp4so2wloi
Correcting diacritics and typos with a ByT5 transformer model
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work, we tackle both problems at once by employing the newly-developed universal ByT5 byte-level seq2seq transformer model that requires no language-specific model structures. ...
Our approach is also able to restore diacritics in words not seen during training with > 76% accuracy. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
arXiv:2201.13242v2
fatcat:o5rn53acofbg3p52mfeyucgngu
Explaining Universal Tendencies and Language Particulars in Analogical Change
[chapter]
2008
Linguistic Universals and Language Change
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Finally, the extreme frequency difference between unmarked and marked forms makes data about suffixed forms quite sparse for the learner. ...
Since the procedures for base selection and grammar induction are both deterministic, this model makes strong predictions about possible analogical changes: they must be based on the most informative form ...
doi:10.1093/acprof:oso/9780199298495.003.0007
fatcat:tw33lxzeazeofkvtbtvrbnkjsa
An Optimal Method for Developing Global Supply Chain Management System
2013
Journal of Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this point of view, this study deals with the complicated liberalization policies in the global supply chain management system and proposes a mathematical model via the flow-control constraints, which ...
Numerical experiments illustrate that the proposed model can be effectively solved to obtain the optimal profits in the global supply chain environment. ...
Acknowledgments The authors would like to thank the editor and anonymous referees for providing most valuable comments for us to improve the quality of this paper. ...
doi:10.1155/2013/197370
fatcat:h433j3mk4naxjhxrnfeklaib7u
« Previous
Showing results 1 — 15 out of 260 results