1169 search results - page 7 / 234 » Degrees of monotone complexity |
FOCS
2003
IEEE
14 years 23 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
A novel method for online tracking of the changes in the nonlinearity within complex–valued signals is introduced. This is achieved by a collaborative adaptive signal processing...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
