1214 search results - page 15 / 243 » Labeling Points with Weights |
179
click to vote
ICPR
2008
IEEE
16 years 1 days ago
2008
IEEE
We propose a semi-supervised learning algorithm for discriminant analysis, which uses the geometric structure of both labeled and unlabeled samples and perform a manifold regulari...
171
click to vote
BIRTHDAY
2009
Springer
15 years 3 months ago
2009
Springer
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A gene...
153
click to vote
DLOG
2009
15 years 3 months ago
2009
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
146
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
123
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...