1658 search results - page 62 / 332 » Learning Unknown Graphs |
139
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
148
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
172
click to vote
ILP
2007
Springer
15 years 11 months ago
2007
Springer
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
315
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
Complex human activities occurring in videos can be defined in terms of temporal configurations of primitive actions. Prior work typically hand-picks the primitives, their total...
152
Voted
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...