3244 search results - page 312 / 649 » On convex complexity measures |
177
click to vote
JMLR
2010
15 years 1 months ago
2010
A complex modern manufacturing process is normally under consistent surveillance via the monitoring of signals/variables collected from sensors. However, not all of these signals ...
189
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
179
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
183
click to vote
IISWC
2008
IEEE
16 years 1 months ago
2008
IEEE
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...
181
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...