Sciweavers

6036 search results - page 1090 / 1208
» Web search solved
Sort
View
JMLR
2010
149views more  JMLR 2010»
14 years 11 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
SIAMDM
2010
101views more  SIAMDM 2010»
14 years 11 months ago
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
TCSV
2010
14 years 11 months ago
Action Detection in Cluttered Video With Successive Convex Matching
We propose a novel successive convex matching method for human action detection in cluttered video. Human actions are represented as sequences of poses, and specific actions are de...
Hao Jiang, Mark S. Drew, Ze-Nian Li
TIT
2010
130views Education» more  TIT 2010»
14 years 11 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
TSP
2010
14 years 11 months ago
A new parametric GLRT for multichannel adaptive signal detection
A parametric generalized likelihood ratio test (GLRT) for multichannel signal detection in spatially and temporally colored disturbance was recently introduced by modeling the dist...
Pu Wang, Hongbin Li, Braham Himed
« Prev « First page 1090 / 1208 Last » Next »