Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
In this paper, we present a Bayesian framework for the fully automatic tracking of a variable number of interacting targets using a fixed camera. This framework uses a joint multi...
Kevin Smith, Daniel Gatica-Perez, Jean-Marc Odobez
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...