3643 search results - page 15 / 729 » Learning Submodular Functions |
MP
2011
14 years 4 months ago
2011
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
SADM
2010
14 years 8 months ago
2010
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
101
click to vote
JMLR
2008
14 years 10 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...