742 search results - page 64 / 149 » Visualizing Graphs - A Generalized View |
127
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
113
Voted
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
113
Voted
PAKDD
2004
ACM
15 years 8 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
199
Voted
IWPEC
2010
Springer
15 years 15 days ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
188
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...