2100 search results - page 333 / 420 » Learning to rank on graphs |
205
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
160
click to vote
GECCO
2009
Springer
16 years 29 days ago
2009
Springer
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
191
click to vote
SG
2010
Springer
15 years 11 months ago
2010
Springer
While many visualization tools exist that offer sophisticated functions for charting complex data, they still expect users to possess a high degree of expertise in wielding the to...
207
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
167
click to vote
EMNLP
2010
15 years 4 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...