• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (45)
  • 
    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 Page: 1 2 3 Hits 1 – 20 of 45 1 Formal Metatheory of Second-Order Abstract Syntax ... Fiore, Marcelo; Szamozvancev, Dmitrij. - : arXiv, 2022 BASE Show details 2 Boolean proportions ... Antić, Christian. - : arXiv, 2021 BASE Show details 3 Polynomial Graph Parsing with Non-Structural Reentrancies ... Björklund, Johanna; Drewes, Frank; Jonsson, Anna. - : arXiv, 2021 BASE Show details 4 The Linear Arrangement Library. A new tool for research on syntactic dependency structures ... Alemany-Puig, Lluís; Esteban, Juan Luis; Ferrer-i-Cancho, Ramon. - : arXiv, 2021 BASE Show details 5 Complete Variable-Length Codes: An Excursion into Word Edit Operations Néraud, Jean In: LATA 2020 ; https://hal.archives-ouvertes.fr/hal-02389403 ; LATA 2020, Mar 2020, Milan, Italy (2020) BASE Show details 6 Continuous Fuzzy Transform as Integral Operator ... Patanè, Giuseppe. - : arXiv, 2020 BASE Show details 7 The optimality of syntactic dependency distances ... Ferrer-i-Cancho, Ramon; Gómez-Rodríguez, Carlos; Esteban, Juan Luis. - : arXiv, 2020 BASE Show details 8 The relationship between word complexity and computational complexity in subshifts Pavlov, Ronnie; Vanier, Pascal In: https://hal.archives-ouvertes.fr/hal-02063174 ; 2019 (2019) BASE Show details 9 Edge crossings in random linear arrangements ... Alemany-Puig, Lluís; Ferrer-i-Cancho, Ramon. - : arXiv, 2019 Abstract: In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here we investigate the general of problem of the distribution of edge crossings in random arrangements of the vertices. We generalize the existing formula for the expectation of this number in random linear arrangements of trees to any network and derive an expression for the variance of the number of crossings in an arbitrary layout relying on a novel characterization of the algebraic structure of that variance in an arbitrary space. We provide compact formulae for the expectation and the variance in complete graphs, complete bipartite graphs, cycle graphs, one-regular graphs and various kinds of trees (star trees, quasi-star trees and linear trees). In these networks, the scaling of expectation and variance as a function of network size is asymptotically power-law-like in ... : Generalised our theory from one-dimensional layouts to practically any type of layout. This helps study the variance of the number of crossings in graphs when their vertices are arranged on the surface of a sphere, or on the plane. Moreover, we also give closed formulae for this variance on particular types of graphs in both linear arrangements and general layouts ... Keyword: Combinatorics math.CO; Discrete Mathematics cs.DM; FOS Computer and information sciences; FOS Mathematics; FOS Physical sciences; Physics and Society physics.soc-ph URL: https://dx.doi.org/10.48550/arxiv.1910.03926 https://arxiv.org/abs/1910.03926 BASE Hide details 10 Memory limitations are hidden in grammar ... Gómez-Rodríguez, Carlos; Christiansen, Morten H.; Ferrer-i-Cancho, Ramon. - : arXiv, 2019 BASE Show details 11 Avoiding or limiting regularities in words Ochem, Pascal; Rao, Michaël; Rosenfeld, Matthieu In: Sequences, Groups and Number Theory ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02083655 ; Sequences, Groups and Number Theory, pp.177-212, 2018, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_5⟩ (2018) BASE Show details 12 Tools for the analysis of noisy discrete curves ; Outils pour l'analyse des courbes discrètes bruitées Nasser, Hayat. - : HAL CCSD, 2018 In: https://tel.archives-ouvertes.fr/tel-01947024 ; Géométrie algorithmique [cs.CG]. Université de Lorraine, 2018. Français. ⟨NNT : 2018LORR0159⟩ (2018) BASE Show details 13 Trees in the Real Field ... Betti, Alessandro; Gori, Marco. - : arXiv, 2018 BASE Show details 14 K4-free Graphs as a Free Algebra Cosme-Llópez, Enric; Pous, Damien In: 42nd International Symposium on Mathematical Foundations of Computer Science ; https://hal.archives-ouvertes.fr/hal-01515752 ; 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark (2017) BASE Show details 15 Approximations from Anywhere and General Rough Sets ... Mani, A.. - : arXiv, 2017 BASE Show details 16 Embedded-Graph Theory ... Yokoyama, Atsushi. - : arXiv, 2017 BASE Show details 17 Matroids Hitting Sets and Unsupervised Dependency Grammar Induction ... Harvey, Nicholas; Mirrokni, Vahab; Karger, David. - : arXiv, 2017 BASE Show details 18 Parsing with Traces: An $O(n^4)$ Algorithm and a Structural Representation ... Kummerfeld, Jonathan K.; Klein, Dan. - : arXiv, 2017 BASE Show details 19 Palindromic language of thin discrete planes Domenjoud, Eric; Provençal, Xavier; Vuillon, Laurent In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.archives-ouvertes.fr/hal-01262289 ; Theoretical Computer Science, Elsevier, 2016, pp.101-108. ⟨10.1016/j.tcs.2015.11.023⟩ (2016) BASE Show details 20 Synchronizing Relations on Words Figueira, Diego; Libkin, Leonid In: ISSN: 1432-4350 ; EISSN: 1433-0490 ; Theory of Computing Systems ; https://hal.archives-ouvertes.fr/hal-01778459 ; Theory of Computing Systems, Springer Verlag, 2015, 57 (2), pp.287 - 318. ⟨10.1007/s00224-014-9584-2⟩ (2015) BASE Show details Page: 1 2 3

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