Sciweavers

2362 search results - page 41 / 473
» Programming in Standard ML
Sort
View
ML
2008
ACM
14 years 11 months ago
Layered critical values: a powerful direct-adjustment approach to discovering significant patterns
Standard pattern discovery techniques, such as association rules, suffer an extreme risk of finding very large numbers of spurious patterns for many knowledge discovery tasks. The...
Geoffrey I. Webb
ESOP
2009
Springer
15 years 6 months ago
Practical Variable-Arity Polymorphism
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
T. Stephen Strickland, Sam Tobin-Hochstadt, Matthi...
APLAS
2004
ACM
15 years 5 months ago
Region-Based Memory Management for a Dynamically-Typed Language
Abstract. Region-based memory management scheme has been proposed for the programming language ML. In this scheme, a compiler statically estimates the lifetime of each object by pe...
Akihito Nagata, Naoki Kobayashi, Akinori Yonezawa
ML
2010
ACM
159views Machine Learning» more  ML 2010»
14 years 10 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ENTCS
2006
153views more  ENTCS 2006»
14 years 12 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu