Sciweavers

10304 search results - page 367 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
MFCS
2009
Springer
16 years 1 months ago
Size and Energy of Threshold Circuits Computing Mod Functions
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
ITICSE
2000
ACM
15 years 11 months ago
Student well-being in a computing department
We describe a project exploring the relationships between factors in the learning environment, student well-being and learning outcomes, in the context of a Computing department. ...
J. R. Davy, K. Audin, M. Barkham, C. Joyner
FOCS
1997
IEEE
15 years 11 months ago
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...
Eyal Kushilevitz, Rafail Ostrovsky

Book
422views
17 years 5 months ago
Intelligence: The Eye, the Brain and the Computer
"This book is intended to be an intellectual journey into the domain of human and machine intelligence". The book covers several topics such as intelligence, knowledge re...
M. A. Fischler, O. Firschein
STACS
2010
Springer
16 years 1 months ago
Computing Least Fixed Points of Probabilistic Systems of Polynomials
We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly
Javier Esparza, Andreas Gaiser, Stefan Kiefer