1888 search results - page 64 / 378 » Proof theory and computational analysis |
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
ECCV
2006
Springer
14 years 2 months ago
2006
Springer
We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (lowresolution) im...
AML
2008
13 years 11 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
NIPS
2000
14 years 7 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...