We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
Richard Cleve, Wim van Dam, Michael Nielsen, Alain...
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
Fuzzy vectors were introduced as a description of imprecise quantities whose uncertainty originates from vagueness, not from a probabilistic model. Support functions are a classica...