ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1212.2573
  4. Cited By
Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs

Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs

11 December 2012
K. S. S. Kumar
Francis R. Bach
ArXiv (abs)PDFHTML

Papers citing "Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs"

2 / 2 papers shown
Title
Maximizing submodular functions using probabilistic graphical models
Maximizing submodular functions using probabilistic graphical models
K. S. S. Kumar
Francis R. Bach
44
3
0
10 Sep 2013
A Junction Tree Framework for Undirected Graphical Model Selection
A Junction Tree Framework for Undirected Graphical Model Selection
Divyanshu Vats
Robert D. Nowak
CML
135
8
0
17 Apr 2013
1