We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are ...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Om...
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...