Sciweavers

87 search results - page 15 / 18
» Elements of Argumentation
Sort
View
SFP
2001
15 years 7 months ago
Function Types in Complete Type Inference
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
Manfred Widera, Christoph Beierle
MP
2002
103views more  MP 2002»
15 years 5 months ago
Detecting Jacobian sparsity patterns by Bayesian probing
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
Andreas Griewank, Christo Mitev
CORR
2011
Springer
138views Education» more  CORR 2011»
15 years 27 days ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
TLT
2010
95views more  TLT 2010»
15 years 18 days ago
Mobile Learning in School Contexts: Can Teachers Alone Make It Happen?
Evidence from a range of studies indicates the potential that mobile technologies have to support important aspects of learning. However, it is clear from a number of study finding...
Don Passey
ICALP
2009
Springer
16 years 6 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty