Sciweavers

53 search results - page 8 / 11
» Real algebraic numbers and polynomial systems of small degre...
Sort
View
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
14 years 1 months ago
Comprehensive Triangular Decomposition
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...
Changbo Chen, Oleg Golubitsky, François Lem...
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 20 days ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ICIP
1998
IEEE
14 years 8 months ago
Covariant Conics Decomposition of Quartics for 2D Object Recognition and Affine Alignment
This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system...
Jean-Philippe Tarel, William Wolovich and David B...
ASIACRYPT
2000
Springer
13 years 12 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
POPL
2009
ACM
14 years 2 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...