Sciweavers

18090 search results - page 269 / 3618
» Computing by Only Observing
Sort
View
EUROCRYPT
2000
Springer
15 years 10 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
AMC
2008
111views more  AMC 2008»
15 years 6 months ago
Numerical stability of fast computation algorithms of Zernike moments
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While m...
George A. Papakostas, Yiannis S. Boutalis, Constan...
ICPR
2008
IEEE
16 years 29 days ago
Computer graphics identification using genetic algorithm
This paper proposes the use of genetic algorithm to select an optimal feature set for distinguishing computer graphics from digital photographic images. Our previously developed a...
Wen Chen, Yun Q. Shi, Guorong Xuan, Wei Su
IJAR
2006
103views more  IJAR 2006»
15 years 6 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
TDSC
2008
125views more  TDSC 2008»
15 years 6 months ago
Trustworthy Computing under Resource Constraints with the DOWN Policy
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
Mahalingam Ramkumar