Sciweavers

3353 search results - page 561 / 671
» Laver and set theory
Sort
View
ML
2008
ACM
15 years 6 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
JSC
2006
102views more  JSC 2006»
15 years 6 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
KAIS
2006
121views more  KAIS 2006»
15 years 6 months ago
Using discriminant analysis for multi-class classification: an experimental investigation
Abstract. Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the...
Tao Li, Shenghuo Zhu, Mitsunori Ogihara
LMCS
2006
79views more  LMCS 2006»
15 years 6 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
ML
2006
ACM
15 years 6 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik