Sciweavers

1291 search results - page 6 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
MICS
2007
88views more  MICS 2007»
13 years 7 months ago
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
Philip Feinsilver, René Schott
PAMI
2008
185views more  PAMI 2008»
13 years 7 months ago
Three-View Multibody Structure from Motion
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
René Vidal, Richard Hartley
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy
PPOPP
2009
ACM
14 years 8 months ago
Solving dense linear systems on platforms with multiple hardware accelerators
In a previous paper we show how the FLAME methods and tools provide a solution to compute dense dense linear algebra operations on a multi-GPU platform with reasonable performance...
Enrique S. Quintana-Ortí, Francisco D. Igua...