3244 search results - page 65 / 649 » On convex complexity measures |
105
click to vote
COCO
1995
Springer
15 years 3 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
NIPS
2000
15 years 27 days ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
WIOPT
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we investigate the stability and delay issues of a two-user multi-access channel at the bit level. The two users, have the option to transmit at a higher rate (measu...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used...
PKDD
2004
Springer
15 years 4 months ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...