We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Abstract— This paper addresses a novel approach to the nvehicle collision avoidance problem. The vehicle model used is a planar unicycle, chosen for its wide applicability to gro...
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Abstract. The advent of digital photography calls for effective techniques for managing growing amounts of color images. Systems that only rely on low-level image features are now...