1658 search results - page 37 / 332 » Learning Unknown Graphs |
108
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
132
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
123
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
131
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
ECCV
2008
Springer
16 years 3 months ago
2008
Springer