Sciweavers

5608 search results - page 306 / 1122
» On the Theory of Matchgate Computations
Sort
View
ECCC
2006
97views more  ECCC 2006»
15 years 6 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
SIGCPR
2006
ACM
106views Hardware» more  SIGCPR 2006»
16 years 21 days ago
Cross-cultural influences on women in the IT workforce
A review of 862 papers published in SIGMIS/CPR proceedings over the past 44 years revealed only 29 articles that focused on gender and the IT workforce or gender and IT education,...
Eileen M. Trauth, Jeria L. Quesenberry, Haiyan Hua...
SYNTHESE
2008
69views more  SYNTHESE 2008»
15 years 6 months ago
Dispositional implementation solves the superfluous structure problem
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...
Colin Klein
FOCM
2002
83views more  FOCM 2002»
15 years 6 months ago
A Rigorous ODE Solver and Smale's 14th Problem
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
Warwick Tucker
TCS
1998
15 years 6 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen