Displaying 81 – 100 of 108

Showing per page

Graph fibrations, graph isomorphism, and PageRank

Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna (2006)

RAIRO - Theoretical Informatics and Applications

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...

Graphics card as a cheap supercomputer

Přikryl, Jan (2013)

Programs and Algorithms of Numerical Mathematics

The current powerful graphics cards, providing stunning real-time visual effects for computer-based entertainment, have to accommodate powerful hardware components that are able to deliver the photo-realistic simulation to the end-user. Given the vast computing power of the graphics hardware, its producers very often offer a programming interface that makes it possible to use the computational resources of the graphics processors (GPU) to more general purposes. This step gave birth to the so-called...

Graphs of low chordality.

Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Gröbner δ-bases and Gröbner bases for differential operators

Francisco J. Castro-Jiménez, M. Angeles Moreno-Frías (2002)

Banach Center Publications

This paper deals with the notion of Gröbner δ-base for some rings of linear differential operators by adapting the works of W. Trinks, A. Assi, M. Insa and F. Pauer. We compare this notion with the one of Gröbner base for such rings. As an application we give some results on finiteness and on flatness of finitely generated left modules over these rings.

Grounding and extracting modal responses in cognitive agents: 'AND' query and states of incomplete knowledge

Radosław Katarzyniak, Agnieszka Pieczynska-Kuchtiak (2004)

International Journal of Applied Mathematics and Computer Science

In this study an original way of modeling language grounding and generation for a simple set of language responses is presented. It is assumed that the language is used by a cognitive agent and consists of a few modal belief and possibility formulas that are used by this agent to communicate its opinions on the current state of an object. The cognitive agent is asked a simple AND query and the language is tailored to this situation. The agent's knowledge bases are characterized by certain incompleteness...

Currently displaying 81 – 100 of 108