Sciweavers

72 search results - page 6 / 15
» Proving Consistency of Equational Theories in Bounded Arithm...
Sort
View
JSC
2006
102views more  JSC 2006»
13 years 7 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
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 7 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
MCMASTER
1993
13 years 11 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
NIPS
2007
13 years 8 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...