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
Lecture Notes in Computer Science
substrings are prefixes of blocks of length at most 2 m+2 starting at multiples of 2 m Use Duval's algorithm with time O(2 m+2 ) to compute minsuffixes of all S , j ∈ [1, n], starting at a fixed multiple ... : log n/τ rounds of Duval's algorithm -O(n log n/τ ) time overall Lyndon decomposition Lyndon string -strictly smaller than any of its rotations Example: aabc < abca, bcaa, cabb Lyndon decomposition: s ...doi:10.1007/978-3-319-07566-2_4 fatcat:gyfrudldtfbfnh4q3vl24hwzwa
We first revisit two special cases of the problem, introduced by Babenko, Kolesnichenko and Starikovskaya [CPM'13], in which we are asked to compute the minimal non-empty and the maximal suffixes of a ... As a sample application, we show that this data structure can be used to compute the Lyndon decomposition of any substring of T in O(k τ) time, where k is the number of distinct factors in the decomposition ... Lemma 2 allows to compute ν in O(1) time using the enhanced suffix array of T R . ...arXiv:1309.5618v1 fatcat:dkhrkfrsfzh7zazl42lshribiy
The combinatorial tools lead to elegant descriptions of geometrical features and efficient algorithms. ... Among these, radix-trees are useful for efficiently detecting path intersection, Lyndon and Christoffel words appear as the main tools for describing digital convexity; equations on words allow to better ... Then the Lyndon factorization of w is obtained by cutting w just before each left-to-right minimum of its suffix-array. ...doi:10.4204/eptcs.63.1 fatcat:fpk5rmh7r5dvbp6st2jjxh4bju
Spence, Adaptive numerical solution of integral equations with ap- plication to a problem with a boundary layer (pp. 75-89); Dieter Jungnickel and Alexander Pott, Computational nonexistence re- sults for ... Santoro, On the fault-tolerance of reconfigurable VLSI systolic arrays (pp. 197- 210); E. S. Seah and D. R. Stinson, A perfect one-factorization for Ka (pp. 211-213); Gustavus J. ...
Lecture Notes in Computer Science
The Gluing lemma can also be applied to construct universal cycles for other combinatorial objects including passwords and labeled graphs. ... The construction can be implemented to generate each character in constant amortized time using O(n) space which based on a simple lemma for gluing universal cycles together. ... The sliding window of size at most n can be implemented using circular array data structure that requires a constant amount of computation per character to update while using O(n) space. ...doi:10.1007/978-3-642-45278-9_33 fatcat:bjt4nrvnyzhmdik7kt3wjggycm
Jiang, Relating the power of cellular arrays to their closure , O.H., T. Jiang and H. ... Smyth, Optimal algorithms for computing the canonical form of a circular string 92 (1) (1992) 87-105 Immerman, N. and S.R. ...doi:10.1016/0304-3975(92)90292-n fatcat:ekwes6owtrco3lkfkiqagnketq
Rytter, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays 88 (1) (1991) 59-82 1642. M. Garzon and Y. ... Jiang, Relating the power of cellular arrays to their closure properties 57 (2-3) (1988) 225-238 G. Duchamp and J.Y. ...doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m
What if we are only allowed to flip the top n−2, n−1, or n (burnt) pancakes? We answer the first question with simple successor rules that take worstcase O(n)-time and amortized O(1)-time. ... In both cases, a computer program can efficiently generate suitable solutions. We approach these tasks instead from a human perspective. ... The following corollary follows immediately from this lemma since it is not possible for any flip Gray code L for P(n) to have less total flips of size 2, 3, . . . , k compared to Min(n) for any 2 ≤ k ...doi:10.1016/j.tcs.2015.09.007 fatcat:px5howptsfhvzmxsnfftcchvbe
~troE: Computation of the ei- genelements of a matrix by the epsilon- algorithm, 11:7-20 (1975) Bazzn~sm, CLAUDE: Some results in the theory of the vector epsflon-algorithm, 8:77-86 (1974) BmDCES, ... matrix, 85:191-202 (1987) LUENBmaCF~, DAVID G.: See Yamada, Takeo LUK, b'~t~XLm T.: A triangular processor array for computing singular values: Special volume on parallel computing, 77:259-273(1986)Lvx ...doi:10.1016/0024-3795(88)90386-2 fatcat:vbli3cgvuzcrhhvjrow447hq2i
Current remote-sensing technologies enable wind-engineering researchers to examine tornado effects on the built environment at various spatial scales ranging from the overall path to the neighborhood, ... Direct measurements of tornado winds are rare and nearly impossible to acquire, and the pursuit of in situ wind measurements can be precarious, dangerous, and even necessitating the development of safer ... The per-building level also forms a logical basis for automated assessments via computer algorithms as groups of contiguous pixels (representing individual structures) serve as the basis for numerous automated ...doi:10.3389/fbuil.2018.00066 fatcat:5mowfuw7pfh4taf5c2bxbvjp5e
Acknowledgements The author wishes to thank advisors Mihai Pop and Aravind Srinivasan for their support, guidance, and encouragement. ... Acknowledgements This collaboration started at Shonan seminar 126, "Computation over Compressed Structured Data" and the results from the first part of the paper were proven there. ... This algorithm computes the Lyndon factorization of the concatenation of two strings by using their Lyndon factorizations. ...doi:10.4230/lipics.cpm.2018 fatcat:dr4unwwranbsjjr3kciuybrovy
in 1507 1996 finding the most vital edge with respect to SKT reliability in BSP digraphs. ... (English summary) (see 96h:68009 ) 68R_ Discrete mathematics in relation to computer science 68R15 Galil, Zvi see Breslauer, Dany, 96f:68088 Garel, Emmanuelle On the separators on an infinite word generated ...
Indeed, to leverage the full potential of UAS-based approaches, sensing technologies, measurement protocols, postprocessing techniques, retrieval algorithms, and evaluation techniques need to be harmonized ... As well as showcasing recent advances in the field, there is also a need to identify and understand the potential limitations of UAS technology. ... They evaluated an algorithm to adjust the UAS route under changes in wind (intensity and direction) to minimize the waste of pesticides. Peña et al. ...doi:10.3390/rs10040641 fatcat:d3io26h4iva5fd2k5r7uedznum
To demonstrate the potential for phenotypic screening, we analyzed growth dynamics and morphology of the condensed collection and identified growth defects and altered cell shape in the sphingolipid-synthesis ... Here, we sorted cells from a pooled library to construct an ordered collection of transposon-insertion mutants in the model commensal Bacteroides thetaiotaomicron. ... Paula Welander for critical insights and members of the Huang lab for helpful discussions. This work was funded by NIH RM1 Award GM135102 (to A.D. and K.C.H.) and R01 AI147023 (to K.C.H.). ...doi:10.1101/2021.12.27.474270 fatcat:2hssnxtr3ndsjasrd37wosp5vi
Against the Grain
Isobel Thompson, Senior Strategy Analyst, Holtzbrinck Publishing Group, noted that AI-based systems are intuition machines, in contrast to traditional computers which are logic machines. ... The meeting featured the usual array of plenary and concurrent sessions as well as a day of pre-conference and sponsored sessions on topics of special interest and a review of new and noteworthy products ... In addition to blogging and writing about conferences for Against the Grain, he blogs the Computers in Libraries and Internet Librarian conferences for Information Today, Inc. ...doi:10.7771/2380-176x.8304 fatcat:uqfubrmqere6ngcmv4eyy5anyq
« Previous Showing results 1 — 15 out of 93 results