Sciweavers

1615 search results - page 114 / 323
» Computer science and decision theory
Sort
View
FOCS
2003
IEEE
15 years 9 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
ITICSE
2006
ACM
15 years 10 months ago
Peer teaching extends HCI learning
Crafting a good user experience requires skills in several disciplines. Few people have this breadth of knowledge, and undergraduate computer science students are no exception. En...
Beryl Plimmer, Robert Amor
KBSE
2010
IEEE
15 years 2 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
SIGCSE
2008
ACM
166views Education» more  SIGCSE 2008»
15 years 4 months ago
Defense against the dark arts
Computer science faculty must attract and retain students by offering innovative courses that spark student interest, yet still teach core, computer science concepts. These effort...
Mark W. Bailey, Clark L. Coleman, Jack W. Davidson
HICSS
2005
IEEE
153views Biometrics» more  HICSS 2005»
15 years 9 months ago
Developing a Knowledge-Based Organizational Performance Model for Discontinuous Participatory Enterprises
Our research seeks to understand how to extend established organization theory and emerging knowledgeflow theory to inform the design of organizations with discontinuous participa...
Rahinah Ibrahim, Mark E. Nissen