Results 31 to 40 of about 2,350 (110)
On the Frobenius’ Problem of three numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Given $k$ natural numbers $\{a_1, \ldots ,a_k\} \subset \mathbb{N}$ with $1 \leq a_1 < a_2 < \ldots < a_k$ and $\mathrm{gcd} (a_1, \ldots ,a_k)=1$, let be $R(a_1, \ldots ,a_k) = \{ \lambda_1 a_1+ \cdots + \lambda_k a_k | \space \lambda_i \in \mathbb{N ...
Francesc Aguiló, Alícia Miralles
doaj +1 more source
A Poset Classifying Non-Commutative Term Orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We study a poset $\Re$ on the free monoid (X*) on a countable alphabet X.This poset is determined by the fact that its total extensions are precisely the standard term orders on X*.
Jan Snellman
doaj +1 more source
Attention allocation in information-rich environments:the case of news aggregators [PDF]
, 2016 News aggregators have emerged as an important component of digital content ecosystems, attracting traffic by hosting curated collections of links to third party content, but also inciting conflict with content producers.
Calin, Mihai +3 more
core +1 more source
Left and right length of paths in binary trees or on a question of Knuth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$.
Alois Panholzer
doaj +1 more source
CUI@CSCW: Collaborating through Conversational User Interfaces [PDF]
, 2020 This virtual workshop seeks to bring together the burgeoning communities centred on the design, development, application and study of so-called Conversational User Interfaces (CUIs).
Cowan Benjamin R +4 more
core +1 more source
Limit distribution of the size of the giant component in a web random graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Consider random graph with $N+ 1$ vertices as follows. The degrees of vertices $1,2,\ldots, N$ are the independent identically distributed random variables $\xi_1, \xi_2, \ldots , \xi_N$ with distribution $\mathbf{P}\{\xi_1 \geq k\}=k^{− \tau},$ $k= 1,2,\
Yuri Pavlov
doaj +1 more source
Chip-Firing and Rotor-Routing on $\mathbb{Z}^d$ and on Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The sandpile group of a graph $G$ is an abelian group whose order is the number of spanning trees of $G$. We find the decomposition of the sandpile group into cyclic subgroups when $G$ is a regular tree with the leaves are collapsed to a single vertex ...
Itamar Landau +2 more
doaj +1 more source
Kernel perfect and critical kernel imperfect digraphs structure [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A kernel $N$ of a digraph $D$ is an independent set of vertices of $D$ such that for every $w \in V(D)-N$ there exists an arc from $w$ to $N$. If every induced subdigraph of $D$ has a kernel, $D$ is said to be a kernel perfect digraph. Minimal non-kernel
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
Gardens of Eden and Fixed Points in Sequential Dynamical Systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was proposed in [BMR99,BR99] as an abstract model of computer simulations.
Christopher Barrett +6 more
doaj +1 more source
Data Portraits and Intermediary Topics: Encouraging Exploration of Politically Diverse Profiles
, 2016 In micro-blogging platforms, people connect and interact with others. However, due to cognitive biases, they tend to interact with like-minded people and read agreeable information only.
Al Zamal F. +11 more
core +1 more source