Sciweavers

2434 search results - page 344 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
124
Voted
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 9 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
154
Voted
DAGM
2005
Springer
15 years 9 months ago
Cluster-Based Point Cloud Analysis for Rapid Scene Interpretation
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
Eric Wahl, Gerd Hirzinger
139
Voted
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
15 years 9 months ago
Exploiting gradient information in numerical multi--objective evolutionary optimization
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
Peter A. N. Bosman, Edwin D. de Jong
158
Voted
IBERAMIA
2004
Springer
15 years 9 months ago
Statistical Inference in Mapping and Localization for Mobile Robots
In this paper we tackle the problem of providing a mobile robot with the ability to build a map of its environment using data gathered during navigation. The data correspond to the...
Anita Araneda, Alvaro Soto
ATAL
2008
Springer
15 years 5 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman