Sciweavers

10271 search results - page 327 / 2055
» Computer Science
Sort
View
CCA
2009
Springer
16 years 1 months ago
Computing Conformal Maps onto Canonical Slit Domains
We extend the results of [2] by computing conformal maps onto the canonical slit domains in Nehari [14]. Along the way, we demonstrate the computability of solutions to Neuman prob...
Valentin V. Andreev, Timothy H. McNicholl
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 10 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
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