2100 search results - page 128 / 420 » Learning to rank on graphs |
173
click to vote
IJAC
2008
15 years 6 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
179
click to vote
DA
2010
15 years 3 months ago
2010
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
157
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
177
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
177
click to vote
TCSV
2008
15 years 6 months ago
2008
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...