Sciweavers

3937 search results - page 214 / 788
» Questioning Ubiquitous Computing
Sort
View
COMPGEOM
2005
ACM
15 years 6 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
ECCC
2000
158views more  ECCC 2000»
15 years 3 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
200
Voted
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
15 years 9 months 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...
CPHYSICS
2007
437views more  CPHYSICS 2007»
15 years 4 months ago
Python: a language for computational physics
Python is a relatively new computing language, created by Guido van Rossum (Tanenbaum et al, 1990), which is particularly suitable for teaching a course in computational physics. ...
P. H. Borcherds
ECCC
2000
59views more  ECCC 2000»
15 years 3 months ago
A Simple Model for Neural Computation with Firing Rates and Firing Correlations
A simple extension of standard neural network models is introduced which provides a model for neural computations that involve both firing rates and firing correlations. Such an ex...
Wolfgang Maass