2695 search results - page 285 / 539 » Learning Graph Matching |
133
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
122
Voted
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
135
Voted
DGCI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
142
Voted
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
How can knowing about some categories help us to discover new ones in unlabeled images? Unsupervised visual category discovery is useful to mine for recurring objects without huma...
131
Voted
IPMI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...