Sciweavers

2767 search results - page 406 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 9 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh

Publication
338views
14 years 7 months ago
Shape from Shading with a Generalized Reflectance Map Model
Most conventional SFS (shape from shading) algorithms have been developed under three basic assumptions on surface properties and imaging geometry to simplify the problem, namely, ...
Kyoung Mu Lee (Seoul National University), C.-C. J...
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 3 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
ICCS
2009
Springer
14 years 3 months ago
An Intelligent Tutoring System for Interactive Learning of Data Structures
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
Rafael del Vado Vírseda, Pablo Ferná...
IJCNN
2008
IEEE
14 years 3 months ago
Biologically realizable reward-modulated hebbian training for spiking neural networks
— Spiking neural networks have been shown capable of simulating sigmoidal artificial neural networks providing promising evidence that they too are universal function approximat...
Silvia Ferrari, Bhavesh Mehta, Gianluca Di Muro, A...