Sciweavers

TCS
2011
12 years 11 months ago
Bounds for the generalized repetition threshold
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 ...
Francesca Fiorenzi, Pascal Ochem, Elise Vaslet
JCT
2011
108views more  JCT 2011»
12 years 11 months ago
The number of extreme points of tropical polyhedra
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...
Xavier Allamigeon, Stéphane Gaubert, Ricard...
CORR
2010
Springer
90views Education» more  CORR 2010»
12 years 11 months ago
Multiparty Equality Function Computation in Networks with Point-to-Point Links
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,
Guanfeng Liang, Nitin H. Vaidya
APAL
2011
12 years 11 months ago
Upper bounds on ideals in the computably enumerable Turing degrees
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...
George Barmpalias, André Nies
ACCESSNETS
2009
Springer
13 years 2 months ago
Capacity of Two-Way Relay Channel
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...
Shengli Zhang, Soung Chang Liew, Hui Wang, Xiao-Hu...
ISITA
2010
13 years 2 months ago
Directed information and the NRL Network Pump
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,...
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 2 months ago
On Finding Similar Items in a Stream of Transactions
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...
Andrea Campagna, Rasmus Pagh
GLOBECOM
2010
IEEE
13 years 2 months ago
The Information Propagation Speed Upper Bound in Cognitive Radio Networks
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...
Chuan Han, Yaling Yang
DLOG
2010
13 years 2 months ago
Optimal Rewritings in Definitorially Complete Description Logics
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 . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...
TMI
2010
94views more  TMI 2010»
13 years 2 months ago
Theoretical Bounds and System Design for Multipinhole SPECT
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...
Peter Nillius, Mats Danielsson