6005 search results - page 147 / 1201 » Graph-Theoretical Methods in Computer Vision |
111
Voted
BMVC
1998
15 years 1 months ago
1998
In this paper a fast method of selecting a neural network architecture for pattern recognition tasks is presented. We demonstrate that our proposed method of selecting both input ...
106
Voted
ICPR
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we propose a new algorithm for extending the hierarchical clustering methods and introduce a Multi-View Agglomerative Clustering approach to handle multi-view repre...
105
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
107
Voted
ICCV
2011
IEEE
14 years 17 days ago
2011
IEEE
With nearly one billion online videos viewed everyday, an emerging new frontier in computer vision research is recognition and search in video. While much effort has been devoted ...
105
Voted
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
Motion estimation in image sequences is an important step in many computer vision and image processing applications. Several methods for solving this problem have been proposed, b...