Vol 40, No. 2, June 2006 ISSAC 2006 Poster Abstracts are shaded to make clear that they are not shared. The additional parts allow the non-driving collaborators, called passengers , to contribute to the collaboration by leveraging their display formats. The poster illustrates the points discussed here. In particular, the poster demonstrates display di erences that can result in collaboration problems. The poster also shows how our protocol solves these problems in the collaborative exploration of an in nite fractal image when one collaborator uses a 24-inch display and another collaborator uses a 2.5-inch display. A robust monomial quotient basis for approximate points. Claudia Fassino Dipartimento di Matematica, Universit` di Genova, a via Dodecaneso 35, 16146 Genova, Italy email: fassino@dima.unige.it Let P s = R[x1 , . . . , xs ] be the polynomial ring in s indeterminates over the reals R, let I(X) â P s be the ideal of polynomials which vanish at a set P of m points of Rs , and let R(X) = P s /I(X) be the m-dimensional quotient vector space. Given the set P it is well known how to determine a monomial basis QB = {t1 , . .
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-robust-monomial-quotient-basis-for-approximate-points-PnNG87LwgE
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A robust monomial quotient basis for approximate points
Fassino, Claudia
Follow ACM Communications in Computer Algebra
, Volume 40 (2)
Association for Computing Machinery – Jun 1, 2006
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
