288 search results - page 7 / 58 » random 1998 |
82
Voted
RANDOM
1998
Springer
15 years 2 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
93
Voted
DCC
1998
IEEE
14 years 9 months ago
1998
IEEE
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
TIT
1998
14 years 9 months ago
1998
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
108
click to vote
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
113
click to vote
ECCC
1998
14 years 9 months ago
1998
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...