The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided ...
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
Abstract. In this paper, we study the problem of computing the multiparty equality (MEQ) function: n 2 nodes, each of which is given an input value from {1,
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-th...
The NRL Network Pump R , or Pump, is a standard for mitigating covert channels that arise in a multi-level secure (MLS) system when a high user (HU) sends acknowledgements to a low...
Siva K. Gorantla, Sachin Kadloor, Todd P. Coleman,...
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...