Sciweavers

28 search results - page 1 / 6
» Constructions and bounds for (m, t)-splitting systems
Sort
View
DM
2007
68views more  DM 2007»
13 years 4 months ago
Constructions and bounds for (m, t)-splitting systems
D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. J...
JACM
2002
87views more  JACM 2002»
13 years 4 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi
COMPGEOM
2000
ACM
13 years 9 months ago
A trace bound for the hereditary discrepancy
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
Bernard Chazelle, Alexey Lvov
CIE
2006
Springer
13 years 8 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
ICC
2007
IEEE
112views Communications» more  ICC 2007»
13 years 11 months ago
Algebraic Constructions of Space-Frequency Codes
— Recently an algebraic construction of (nt × Q) space-frequency (SF) codes over finite field Fq was proposed for use in MIMO-OFDM systems, where nt is the number of transmit ...
Mao-Ching Chiu, Hsiao-feng Lu