This paper presents a search engine architecture, RETIN, aiming at retrieving complex categories in large image databases. For indexing, a scheme based on a two-step quantization ...
Philippe Henri Gosselin, Matthieu Cord, Sylvie Phi...
We present the study of a data-driven motion synthesis approach based on a 1D affine imagematching equation. We start by deriving the relevant properties of the exact matching oper...
Most frameworks for utility elicitation assume a predefined set of features over which user preferences are expressed. We consider utility elicitation in the presence of subjecti...
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri...