Sciweavers

1242 search results - page 29 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
COMPGEOM
2010
ACM
14 years 13 days ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
SIGCSE
2004
ACM
112views Education» more  SIGCSE 2004»
14 years 24 days ago
Great principles in computing curricula
The nearly three dozen core technologies of computing sit in a simple framework defined by great principles and by computing practices. The great principles are of two kinds, mech...
Peter J. Denning
CIE
2007
Springer
14 years 1 months ago
From Logic to Physics: How the Meaning of Computation Changed over Time
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
Itamar Pitowsky
ECCC
2000
158views more  ECCC 2000»
13 years 7 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
14 years 20 days ago
From Computer Networks to Agent Networks
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
Guoqiang Zhong, Kenichi Takahashi, Satoshi Amamiya...