3208 search results - page 333 / 642 » A Lower Bound for Primality |
170
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
164
click to vote
TCOM
2008
15 years 6 months ago
2008
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...
136
click to vote
JCO
2007
15 years 6 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
162
click to vote
ARSCOM
2004
15 years 6 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
153
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...