2100 search results - page 229 / 420 » Learning to rank on graphs |
177
click to vote
WEBI
2005
Springer
16 years 2 days ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
193
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
161
Voted
FLAIRS
2003
15 years 8 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
147
click to vote
ICALT
2006
IEEE
16 years 20 days ago
2006
IEEE
This article presents advantages of using context to set up a pedagogical assistance for recognition of collectives situations in Virtual Environment for Training (VET). We are fo...
174
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...