Sciweavers

108 search results - page 2 / 22
» Maximal Intersection Queries in Randomized Graph Models
Sort
View
CVPR
2010
IEEE
13 years 11 months ago
Semantic Context Modeling with Maximal Margin Conditional Random Fields for Automatic Image Annotation
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
Yu Xiang, Xiangdong Zhou, Zuotao Liu, Tat-seng chu...
ICC
2008
IEEE
142views Communications» more  ICC 2008»
13 years 12 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
JMLR
2008
141views more  JMLR 2008»
13 years 5 months ago
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
Mathias Drton, Thomas S. Richardson
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 4 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 1 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák