Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Abstract— We describe a fast method to relocalise a monocular visual SLAM (Simultaneous Localisation and Mapping) system after tracking failure. The monocular SLAM system stores ...