Sciweavers

7006 search results - page 1159 / 1402
» Approximation Algorithms
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
15 years 6 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
165
Voted
WWW
2011
ACM
15 years 1 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
149
Voted
JMLR
2010
105views more  JMLR 2010»
15 years 1 months ago
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
238
Voted
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
« Prev « First page 1159 / 1402 Last » Next »