Sciweavers

2200 search results - page 45 / 440
» Bloch's Constant is Computable
Sort
View
CISC
2009
Springer
154views Cryptology» more  CISC 2009»
14 years 7 months ago
Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication
In a selective private function evaluation (SPFE) protocol, the client privately computes some predefined function on his own input and on m out of server's n database element...
Helger Lipmaa, Bingsheng Zhang
UPP
2004
Springer
15 years 3 months ago
Bio-inspired Computing Paradigms (Natural Computing)
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
Gheorghe Paun
NC
2011
219views Neural Networks» more  NC 2011»
14 years 23 days ago
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...
Paolo Bottoni, Anna Labella, Florin Manea, Victor ...
ICCV
2011
IEEE
13 years 10 months ago
Color Photometric Stereo for Multicolored Surfaces
We present a multispectral photometric stereo method for capturing geometry of deforming surfaces. A novel photometric calibration technique allows calibration of scenes containin...
Robert Anderson, Bjorn Stenger, Roberto Cipolla
FOCS
1990
IEEE
15 years 1 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet