63 search results - page 2 / 13 » Bounds on linear PDEs via semidefinite optimization |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
105
click to vote
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
87
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the robust beamforming problem under imperfect channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. One popular approach to...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
AAAI
2006
14 years 11 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...