83 search results - page 1 / 17 » Applications of semidefinite programming to coding theory |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
EOR
2010
13 years 5 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
SODA
2010
ACM
14 years 2 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...
TSP
2010
13 years 1 days ago
2010
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...