921 search results - page 136 / 185 » Expressing Computational Complexity in Constructive Type The... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
IMAGING
2003
13 years 9 months ago
2003
Many image formation processes are complex interactions of several sub-processes and the analysis of the resulting images requires often to separate the influence of these sub-pr...
AUTOMATICA
2008
13 years 8 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
IM
2007
13 years 8 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...