Sciweavers

8 search results - page 1 / 2
» Being Taught can be Faster than Asking Questions
Sort
View
COLT
1995
Springer
13 years 7 months ago
Being Taught can be Faster than Asking Questions
Ronald L. Rivest, Yiqun Lisa Yin
FPLE
1995
13 years 7 months ago
Basic Proof Skills of Computer Science Students
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...
Pieter H. Hartel, Bert van Es, Dick Tromp
CSR
2009
Springer
13 years 11 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
ALIFE
2008
13 years 4 months ago
Criteria for Conceptual and Operational Notions of Complexity
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
Dominique Chu
CORR
2012
Springer
214views Education» more  CORR 2012»
12 years 1 days ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos