288 search results - page 16 / 58 » random 1998 |
150
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
123
Voted
TPDS
1998
15 years 3 months ago
1998
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
115
click to vote
DM
1998
15 years 3 months ago
1998
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
121
click to vote
CPC
1998
15 years 3 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
131
click to vote
TCS
1998
15 years 3 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...