63 search results - page 8 / 13 » Bounds on linear PDEs via semidefinite optimization |
117
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
108
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
127
click to vote
NIPS
2001
15 years 2 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
116
click to vote
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
101
click to vote
SIGECOM
2003
ACM
15 years 6 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...