A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
In this paper, we formalize the digital library (DL) integration problem and propose an overall approach based on the 5S (streams, structures, spaces, scenarios, and societies) fr...
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...