Sciweavers

1502 search results - page 262 / 301
» Node weighted scheduling
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Contour cut: identifying salient contours in images by solving a Hermitian eigenvalue problem
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
Ryan Kennedy, Jean Gallier, Jianbo Shi
CVPR
2011
IEEE
13 years 12 days ago
Supervised Hypergraph Labeling
We address the problem of labeling individual datapoints given some knowledge about (small) subsets or groups of them. The knowledge we have for a group is the likelihood value fo...
Toufiq Parag, Ahmed Elgammal
CVIU
2011
13 years 5 days ago
Graph attribute embedding via Riemannian submersion learning
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
12 years 11 months ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu
ICML
2009
IEEE
14 years 9 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang