288 search results - page 21 / 58 » random 1998 |
81
Voted
TIT
1998
15 years 1 days ago
1998
Abstract— This correspondence investigates and compares the capacities of two types of frequency-hopped code-division multiple-access (FH-CDMA) communications systems; namely, mu...
RSA
1998
15 years 1 days ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
89
Voted
IPL
1998
15 years 2 days ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
120
click to vote
SIAMCOMP
1998
15 years 1 days ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...