Sciweavers

1066 search results - page 92 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
15 years 1 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
NC
2008
122views Neural Networks» more  NC 2008»
14 years 9 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
ICC
2007
IEEE
15 years 4 months ago
Statistical Simulator for Block Coded Channels with Long Residual Interference
Abstract— In this paper, we present a simple statistical simulation technique for channels with long memory operating under coded data. The proposed technique employs a divideand...
Natasa Blitvic, Vladimir Stojanovic
ICISC
2009
184views Cryptology» more  ICISC 2009»
14 years 7 months ago
Efficient Privacy-Preserving Face Recognition
Abstract. Automatic recognition of human faces is becoming increasingly popular in civilian and law enforcement applications that require reliable recognition of humans. However, t...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Immo We...