Sciweavers

16430 search results - page 384 / 3286
» On Computable Tree Functions
Sort
View
164
Voted
ICONIP
1998
15 years 8 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
SIGGRAPH
1997
ACM
15 years 10 months ago
Non-linear approximation of reflectance functions
We introduce a new class of primitive functions with non-linear parameters for representing light reflectance functions. The functions are reciprocal, energy-conserving and expres...
Eric P. Lafortune, Sing-Choong Foo, Kenneth E. Tor...
178
Voted
PPDP
2007
Springer
16 years 26 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
IPPS
2008
IEEE
16 years 1 months ago
Optimal spot-checking to minimize the computation time in volunteer computing
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
Kan Watanabe, Masaru Fukushi, Susumu Horiguchi
ICDCSW
2002
IEEE
15 years 11 months ago
An Architecture Concept for Ubiquitous Computing Aware Wearable Computers
In Marc Weiser’s vision of ubiquitous computing, users are located in an environment with potentially thousands of computers around them. Many capabilities of these smart device...
Martin Bauer, Bernd Brügge, Gudrun Klinker, A...