2695 search results - page 181 / 539 » Learning Graph Matching |
135
click to vote
SCALESPACE
2005
Springer
15 years 8 months ago
2005
Springer
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
110
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
114
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
135
click to vote
TAGT
1998
Springer
15 years 7 months ago
1998
Springer
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
137
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...