Sciweavers

1931 search results - page 49 / 387
» Why we blog
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Why skewing works: learning difficult Boolean functions with greedy tree learners
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
Bernard Rosell, Lisa Hellerstein, Soumya Ray, Davi...
POPL
2006
ACM
14 years 9 months ago
Why dependent types matter
We exhibit the rationale behind the design of Epigram, a dependently typed programming language and interactive program development system, using refinements of a well known progr...
James McKinna
ACE
2004
171views Education» more  ACE 2004»
13 years 10 months ago
Teaching Computer Architecture in Introductory Computing: Why? and How?
This paper discusses our rationale for teaching the fundamentals of computer architecture early in the computer science (CS) degree program. We also describe an active learning te...
Kris D. Powers
IJVR
2008
158views more  IJVR 2008»
13 years 8 months ago
How and Why Affordable Virtual Reality Shapes the Future of Education
This paper presents an analysis of how and why a new generation of virtual reality peripherals affect virtual reality in general, and its uses for education in particular. We descr...
Barnabas Takacs
MST
2010
121views more  MST 2010»
13 years 7 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna