Sciweavers

7773 search results - page 197 / 1555
» On generalized Frame-Stewart numbers
Sort
View
149
Voted
DCC
1999
IEEE
15 years 10 months ago
Quantized Frame Expansions as Source-Channel Codes for Erasure Channels
Quantized frame expansions are proposed as a method for generalized multiple description coding, where each quantized coe cient is a description. Whereas previous investigations h...
Vivek K. Goyal, Jelena Kovacevic, Martin Vetterli
CHES
1999
Springer
104views Cryptology» more  CHES 1999»
15 years 10 months ago
A Scalable Architecture for Montgomery Multiplication
Abstract. This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the mu...
Alexandre F. Tenca, Çetin Kaya Koç
IWSEC
2010
Springer
15 years 4 months ago
Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption
This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party prot...
Takuho Mitsunaga, Yoshifumi Manabe, Tatsuaki Okamo...
DICTA
2009
15 years 4 months ago
Refining Local 3D Feature Matching through Geometric Consistency for Robust Biometric Recognition
Local features are gaining popularity due to their robustness to occlusion and other variations such as minor deformation. However, using local features for recognition of biometri...
Syed M. S. Islam, Rowan Davies
ICONIP
2009
15 years 4 months ago
Quasi-Deterministic Partially Observable Markov Decision Processes
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
Camille Besse, Brahim Chaib-draa