Sciweavers

1127 search results - page 38 / 226
» Testing the Expansion of a Graph
Sort
View
TALG
2008
69views more  TALG 2008»
13 years 11 months ago
Testing Euclidean minimum spanning trees in the plane
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 ...
Artur Czumaj, Christian Sohler
TRECVID
2007
14 years 4 days ago
SINAI at TRECVID 2007
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...
Manuel Carlos Díaz-Galiano, José M. ...
EMMCVPR
2009
Springer
14 years 5 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
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...
Olga Veksler
ICPR
2004
IEEE
15 years 2 days ago
Robust Modelling of Local Image Structures and Its Application to Medical Imagery
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...
Li Wang, Abhir Bhalerao, Roland Wilson
TREC
2004
14 years 11 days ago
Expanding Queries Using Stems and Symbols
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...
Michela Bacchin, Massimo Melucci