Sciweavers

80 search results - page 16 / 16
» jsc 2006
Sort
View
JSC
1998
68views more  JSC 1998»
13 years 5 months ago
An Algorithm for Computing the Integral Closure
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field. Leonard and Pellikaan [4] devised an algorithm for c...
Theo De Jong
JSC
2006
147views more  JSC 2006»
13 years 5 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan
JSC
2006
71views more  JSC 2006»
13 years 5 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch
JSC
2006
102views more  JSC 2006»
13 years 5 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
JSC
2006
52views more  JSC 2006»
13 years 5 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn