Buscar
Mostrando ítems 1-10 de 303
An exact approach to the problem of extracting an embedded network matrix
(Pergamon-elsevier Science LtdOxfordInglaterra, 2011)
Monetary Policy and Exchange Rate Shocks in Brazil: Sign Restrictions versus A New Hybrid Identification Approach
(Sociedade Brasileira de Econometria, 2011)
Quasi-random words and limits of word sequences
(Elsevier, 2021)
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform ...
Maximum and minimum degree conditions for embedding trees
(Siam, 2020)
We propose the following conjecture: For every fixed alpha is an element of [0, 1/3), each graph of minimum degree at least (1 + alpha)k/2 and maximum degree at least 2(1 - alpha)k contains each tree with k edges as a ...
Canonical forms for isomorphic and equivalent RDF graphs: algorithms for leaning and labelling blank nodes
(ASSOC COMPUTING MACHINERY, 2017)
Existential blank nodes greatly complicate a number of fundamental operations on RDF graphs. In particular,
the problems of determining if two RDF graphs have the same structure modulo blank node labels (i.e. if they
are ...
The search and the eye tracking: a semiotic overlook about the knowledge graph
(Univ Federal Rio Grande Sul, Fac Biblioteconomia & Comunicacao, 2020-01-01)
The eye tracking is, at the same time, a technology and a research method used in several areas of knowledge and, recently, in the area of Information Science. Its main thesis, formulated by Just and Carpenter (1976), is ...
Isomorfismo de Conjuntos de RelacionesIsomorfismo de Conjuntos de Relaciones
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2001)
The search and the eye tracking: a semiotic overlook about the knowledge graphA busca e o eye tracking: um olhar semiótico sobre o knowledge graph
(Universidade Federal do Rio Grande do Sul, Faculdade de Biblioteconomia e Comunicação, Programa de Pós-Graduação em Ciência da Informação (Porto Alegre/RS), 2020)
Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
(ELECTRONIC JOURNAL OF COMBINATORICS, 2008-10-20)
We address the following question: When a randomly chosen regular bipartite multi-graph is drawn in the plane in the "standard way", what is the distribution of its maximum size planar matching (set of non-crossing disjoint ...
Evaluating social policy scenarios for Tourism Development of Baru Island (Colombia) using structural qualitative modeling
(Frontiers Media, 2021)
Social policies are commonly defined from scattered knowledge. It is hard to find examples of social policy design based on a systemic perspective, and even harder with formal modeling support. To advance in filling this ...