1538 search results - page 51 / 308 » Spectral Techniques in Graph Algorithms |
ICCV
2007
IEEE
15 years 2 days ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
IDA
2002
Springer
13 years 10 months ago
2002
Springer
The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for t...
CVPR
2007
IEEE
15 years 4 days ago
2007
IEEE
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...