Skip to main content
Conference ProceedingsOPEN ACCESS

Quasi-affine transformation in higher dimension

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5810 LNCS 493-504
DOI: 10.1007/978-3-642-04397-0_42
8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In many applications and in many fields, algorithms can considerably be speed up if the underlying arithmetical computations are considered carefully. In this article, we present a theoretical analysis of discrete affine transformations in higher dimension. More precisely, we investigate the arithmetical paving structure induced by the transformation to design fast algorithms. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Blot, V., & Coeurjolly, D. (2009). Quasi-affine transformation in higher dimension. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 493–504). https://doi.org/10.1007/978-3-642-04397-0_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free