منابع مشابه
Fast computation of approximant bases in canonical form
In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix multiplication: most other fast approximant basis algorithms basically aim at efficiently reducing the input instance to instances for which PMBasis is fast. Such red...
متن کاملCanonical correlation analysis using within-class coupling
0167-8655/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.patrec.2010.09.025 q The work of O. Kursun was supported by Scienti nation Unit of Istanbul University under the grant YA ⇑ Corresponding author. Tel.: +90 212 473 7070/17 E-mail addresses: [email protected] (O. Kurs Alpaydin), [email protected] (O.V. Favorov). Fisher’s linear discriminant analysis (LDA) is one of the most ...
متن کاملHeight inequalities and canonical class inequalities
This lecture is concerned with apriori bounds on the size of solutions to Diophantine equations. We will present a rather random collection of results with the intention to provide a flavor of the subject, with only a glimpse of something like a unifying principle. In the next lecture, we will make a better attempt to give coherence to our exposition, by describing the relation to canonical cla...
متن کاملCanonical coordinates for a class of solvable groups
For class R, type I solvable groups of the form N H, N nilpotent, H abelian, we construct an explicit layering with cross-sections for coadjoint orbits. We show that any ultrafine layer has a natural structure of fiber bundle. The description of this structure allows us to build explicit local canonical coordinates on .
متن کاملRepresentation of a class of nondeterministic semiautomata by canonical words
It has been shown recently that deterministic semiautomata can be represented by canonical words and equivalences; that work was motivated by the trace-assertion method for specifying software modules. Here, we generalize these ideas to a class of nondeterministic semiautomata. A semiautomaton is settable if, for every state q, there exists a word wq such that q, and no other state, can be reac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1985
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1985-0776197-2