Sciweavers

1523 search results - page 40 / 305
» The Computational Complexity of Linear Optics
Sort
View
CSR
2007
Springer
14 years 3 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 8 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
CVPR
2007
IEEE
14 years 10 months ago
Artificial Complex Cells via the Tropical Semiring
The seminal work of Hubel and Wiesel [14] and the vast amount of work that followed it prove that hierarchies of increasingly complex cells play a central role in cortical computa...
Lior Wolf, Moshe Guttmann
NIPS
2000
13 years 10 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
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...
Robert A. Legenstein, Wolfgang Maass
SIAMSC
2008
106views more  SIAMSC 2008»
13 years 8 months ago
Multilevel Linear Sampling Method for Inverse Scattering Problems
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asympt...
Jingzhi Li, Hongyu Liu, Jun Zou