Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
This paper describes the first participation of the SINAI1 group of the University of Ja´en in TRECVID 2007. We have only participated in the automatic search task. Our approach...
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
A robust modelling method for detecting and measuring isotropic, linear features and bifurcations is described and applied to analysing 2d eletrophoresis and retinal images. Featu...
This paper describes the experiments conducted in the ad-hoc retrieval task of the Genomic track at TREC 2004. Different query expansion techniques based on the addition of keywor...