Sciweavers

8196 search results - page 24 / 1640
» Computational Modeling and Complexity Science
Sort
View
GI
2004
Springer
15 years 3 months ago
Vision as an Exercise in Organic Computing
Abstract: The vision process is very complex and requires for its realization in artificial systems a fundamentally new technology for systems generation. This must be based on pr...
Christoph von der Malsburg
FCT
2001
Springer
15 years 2 months ago
Universal Algebra and Computer Science
Abstract. Generalising modules over associative rings, the notion of modules for an endofunctor of any category is well established and useful in large parts of mathematics includi...
Boris I. Plotkin, Tanya Plotkin
ECCC
2007
90views more  ECCC 2007»
14 years 9 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
CSDA
2011
14 years 4 months ago
Simulation smoothing for state-space models: A computational efficiency analysis
William J. McCausland, Shirley Miller, Denis Pelle...
ICALP
1992
Springer
15 years 1 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg