Sciweavers

7840 search results - page 124 / 1568
» On generalized Ramsey numbers
Sort
View
ARSCOM
2005
92views more  ARSCOM 2005»
13 years 10 months ago
Binary Strings Without Odd Runs of Zeros
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
Ralph Grimaldi, Silvia Heubach
ICASSP
2011
IEEE
13 years 2 months ago
Spatially-correlated sensor discriminant analysis
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
Kush R. Varshney
APAL
2011
13 years 5 months ago
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
Benjamin D. Miller
SACRYPT
2009
Springer
176views Cryptology» more  SACRYPT 2009»
14 years 5 months ago
Optimization Strategies for Hardware-Based Cofactorization
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
Daniel Loebenberger, Jens Putzka
COMBINATORICS
2004
121views more  COMBINATORICS 2004»
13 years 10 months ago
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...
Peter Danziger, Brett Stevens