Sciweavers

2766 search results - page 303 / 554
» Algorithms for trigonometric polynomials
Sort
View
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 9 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
3DPVT
2006
IEEE
158views Visualization» more  3DPVT 2006»
15 years 8 months ago
Revealing Significant Medial Structure in Polyhedral Meshes
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
Svetlana Stolpner, Kaleem Siddiqi
CLUSTER
2001
IEEE
15 years 8 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert
135
Voted
EUROCRYPT
2000
Springer
15 years 8 months ago
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
Anne Canteaut, Michaël Trabbia
137
Voted
AAAI
2008
15 years 7 months ago
Approximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...