91 search results - page 9 / 19 » Learning to Find Graph Pre-images |
115
click to vote
NIPS
2008
15 years 1 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
106
Voted
PVLDB
2008
14 years 12 months ago
2008
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automati...
113
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
101
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...