25 search results - page 2 / 5 » The algebraic degree of semidefinite programming |
AMAST
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
CC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
POPL
2009
ACM
14 years 8 days ago
2009
ACM
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...