Zobrazeno 1 - 10
of 638
pro vyhledávání: '"Puig Lluis"'
Linear arrangements of graphs are a well-known type of graph labeling and are found in many important computational problems, such as the Minimum Linear Arrangement Problem ($\texttt{minLA}$). A linear arrangement is usually defined as a permutation
Externí odkaz:
http://arxiv.org/abs/2312.04487
Publikováno v:
Journal of Language Modelling, 2024, 12(1), 1--42
Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. The tendency of these dependenci
Externí odkaz:
http://arxiv.org/abs/2207.05564
Publikováno v:
Information Processing Letters 183, 106400 (2024)
A linear arrangement is a mapping $\pi$ from the $n$ vertices of a graph $G$ to $n$ distinct consecutive integers. Linear arrangements can be represented by drawing the vertices along a horizontal line and drawing the edges as semicircles above said
Externí odkaz:
http://arxiv.org/abs/2206.06924
Publikováno v:
Proceedings of the Second Workshop on Quantitative Syntax (Quasy, SyntaxFest 2021)
The new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this field is the statistical patterns of syntactic dependency structures. T
Externí odkaz:
http://arxiv.org/abs/2112.02512
Publikováno v:
Journal of Computational Linguistics 48 (3), 491-516 (2022)
The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on dependency distances led to the form
Externí odkaz:
http://arxiv.org/abs/2107.03277
Publikováno v:
Information Processing Letters, 174:106204 (2022)
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a horizontal l
Externí odkaz:
http://arxiv.org/abs/2102.03277
Publikováno v:
Phys. Rev. E 105, 014308 (2022)
It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality score have been scarce and focused mo
Externí odkaz:
http://arxiv.org/abs/2007.15342
Autor:
Puig, Lluis
Let p be a prime, P a finite p-group, F a Frobenius P-category and F^sc the full subcategory of F over the set of F-selfcentralizing subgroups of P. Recently, we have understood an easy way to obtain the perfect F^sc-locality P^sc from the basic F^sc
Externí odkaz:
http://arxiv.org/abs/2003.03567
Publikováno v:
J. Stat. Mech. (2020) 083401
Many real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneering research, Moon analyzed the distribution of the number of crossings
Externí odkaz:
http://arxiv.org/abs/2003.03353
The crossing number of a graph $G$, $\mathrm{cr}(G)$, is the minimum number of edge crossings arising when drawing a graph on a certain surface. Determining $\mathrm{cr}(G)$ is a problem of great importance in Graph Theory. Its maximum variant, i.e.
Externí odkaz:
http://arxiv.org/abs/2003.03258