Sciweavers

1308 search results - page 74 / 262
» Let's Have a Conversation
Sort
View
DCC
2008
IEEE
15 years 10 months ago
Explicit constructions for perfect hash families
Let k, v, t be integers such that k v t 2. A perfect hash family PHF(N; k, v, t) can be defined as an N ? k array with entries from a set of v symbols such that every N ?t suba...
Sosina Martirosyan, Tran van Trung
CCCG
2009
15 years 9 days ago
Bold Graph Drawings
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
Marc J. van Kreveld
AML
2010
118views more  AML 2010»
14 years 11 months ago
The modal logic of continuous functions on the rational numbers
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
Philip Kremer
DAM
2006
49views more  DAM 2006»
14 years 11 months ago
Two-tuple balance of non-binary sequences with ideal two-level autocorrelation
Let p be a prime, q = pm and Fq be the finite field with q elements. In this paper, we will consider q-ary sequences of period qn - 1 for q > 2 and study their various balance ...
Guang Gong, Hong-Yeop Song
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
14 years 11 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...