1291 search results - page 45 / 259 » Computing the multiplicity structure in solving polynomial s... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
ASPDAC
1999
ACM
13 years 12 months ago
1999
ACM
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...
COCOS
2003
Springer
14 years 27 days ago
2003
Springer
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we discuss rate control for multiuser multicarrier systems, where the transmitter has a single antenna and is subject to a PSD mask limitation while the receiver has...