Sciweavers

1658 search results - page 247 / 332
» Learning Unknown Graphs
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
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...
Pradeep D. Ravikumar, John D. Lafferty
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
14 years 2 months ago
Apply ant colony optimization to Tetris
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...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...
ECCV
2010
Springer
14 years 1 months ago
Category Independent Object Proposals
We propose a category-independent method to produce a bag of regions and rank them, such that top-ranked regions are likely to be good segmentations of different objects. Our key ...
SG
2010
Springer
14 years 1 months ago
Articulate: A Semi-automated Model for Translating Natural Language Queries into Meaningful Visualizations
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...
Yiwen Sun, Jason Leigh, Andrew E. Johnson, Sangyoo...
CORR
2010
Springer
228views Education» more  CORR 2010»
13 years 6 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
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...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb