Related papers: Tableau evacuation and webs
A bibliographic database containing studies on recurrence plots and related methods is analyzed from various perspectives. This allows a detailed view of the field's development, showcasing the continuous growth in the method's popularity,…
Recommender systems build user profiles using concept analysis of usage matrices. The concepts are mined as spectra and form Galois connections. Descent is a general method for spectral decomposition in algebraic geometry and topology which…
Template detection and content extraction are two of the main areas of information retrieval applied to the Web. They perform different analyses over the structure and content of webpages to extract some part of the document. However, their…
This paper introduces the concept of Conjectural Link for Complex Networks, in particular, social networks. Conjectural Link we understand as an implicit link, not available in the network, but supposed to be present, based on the…
Searching through networks of documents is an important task. A promising path to improve the performance of information retrieval systems in this context is to leverage dense node and content representations learned with embedding…
In this paper, we confirm a conjecture of Laborde-Zubieta on the enumeration of corners in tree-like tableaux. Our proof is based on Aval, Boussicault and Nadeau's bijection between tree-like tableaux and permutation tableaux, and Corteel…
We use annular foam TQFTs introduced by the first two authors to define equivariant $SL(2)$ and $SL(3)$ web algebras in the annulus. To a diagram of a tangle in the thickened annulus we assign a complex of bimodules over these algebras…
Different classes of communication network topologies and their representation in the form of adjacency matrix and its eigenvalues are presented. A self-organizing feature map neural network is used to map different classes of communication…
In this paper, we prove the existence of fundamental relations between information theory and estimation theory for network-coded flows. When the network is represented by a directed graph G=(V, E) and under the assumption of uncorrelated…
Network reconstruction is a well-developed sub-field of network science, but it has only recently been applied to production networks, where nodes are firms and edges represent customer-supplier relationships. We review the literature that…
The abundant semi-structured data on the Web, such as HTML-based tables and lists, provide commercial search engines a rich information source for question answering (QA). Different from plain text passages in Web documents, Web tables and…
In this paper we establish a connection between the fluctuations of Wishart random matrices, shifted Chebyshev polynomials, and planar diagrams whose linear span form a basis for the irreducible representations of the annular Temperly-Lieb…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…
We propose reformulation of discovery of data structure within a web page as relations between sets of document nodes. We start by reformulating web page analysis as finding expressions in extension of XPath. Then we propose to…
The visual layout of a webpage can provide valuable clues for certain types of Information Extraction (IE) tasks. In traditional rule based IE frameworks, these layout cues are mapped to rules that operate on the HTML source of the…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
The latest generation of Web search tools is beginning to exploit hypertext link information to improve ranking\cite{Brin98,Kleinberg98} and crawling\cite{Menczer00,Ben-Shaul99etal,Chakrabarti99} algorithms. The hidden assumption behind…
A diffusion process on complex networks is introduced in order to uncover their large scale topological structures. This is achieved by focusing on the slowest decaying diffusive modes of the network. The proposed procedure is applied to…
High-quality Web tables are rich sources of information that can be used to populate Knowledge Graphs (KG). The focus of this paper is an evaluation of methods for table-to-class annotation, which is a sub-task of Table Interpretation (TI).…