13 search results - page 2 / 3 » Counting Irreducible Components of Complex Algebraic Varieti... |
MP
2010
13 years 12 days ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
CORR
1998
Springer
13 years 5 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
KDD
1998
ACM
13 years 9 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
CASC
2007
Springer
13 years 11 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
SIAMSC
2010
13 years 4 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...