Sciweavers

499 search results - page 64 / 100
» Constructive Induction by Analogy
Sort
View
ECML
2003
Springer
14 years 2 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank
FOSSACS
2003
Springer
14 years 2 months ago
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Andreas Abel, Ralph Matthes, Tarmo Uustalu
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 9 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 9 months ago
Explicit factors of some iterated resultants and discriminants
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
Laurent Busé, Bernard Mourrain
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 9 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin