Sciweavers

2531 search results - page 202 / 507
» Group testing in graphs
Sort
View
CLEF
2009
Springer
15 years 4 months ago
Overview of the CLEF 2009 Robot Vision Track
The robot vision task has been proposed to the ImageCLEF participants for the first time in 2009. The task attracted a considerable attention, with 19 inscribed research groups, 7...
Andrzej Pronobis, Li Xing, Barbara Caputo
CLEF
2007
Springer
16 years 18 days ago
Multiplying Concept Sources for Graph Modeling
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...
Loïc Maisonnasse, Éric Gaussier, Jean-...
IJCV
2006
299views more  IJCV 2006»
15 years 6 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
CORR
2011
Springer
152views Education» more  CORR 2011»
15 years 1 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
SOQUA
2007
15 years 7 months ago
Faults' context matters
When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evalua...
Jaymie Strecker, Atif M. Memon