Sciweavers

13784 search results - page 260 / 2757
» On Computing Functions with Uncertainty
Sort
View
EUROCRYPT
2006
Springer
14 years 1 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
CGF
2008
99views more  CGF 2008»
13 years 9 months ago
Polyhedral Finite Elements Using Harmonic Basis Functions
Finite element simulations in computer graphics are typically based on tetrahedral or hexahedral elements, which enables simple and efficient implementations, but in turn requires...
Sebastian Martin, Peter Kaufmann, Mario Botsch, Ma...
DCC
2006
IEEE
14 years 9 months ago
Asymptotic Nonlinearity of Boolean Functions
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
François Rodier
FOCS
2009
IEEE
14 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
IEEESCC
2008
IEEE
14 years 4 months ago
Service Functionality Indexing and Matching for Service-Based Systems
In service-based systems, one of the most basic requirements for service matching is to find services with functionalities similar to the expected functionality of a given servic...
Stephen S. Yau, Junwei Liu