Sciweavers

3702 search results - page 35 / 741
» All Pairings Are in a Group
Sort
View
82
Voted
ICIP
2005
IEEE
16 years 2 months ago
An adaptive DCT-based Mod-4 steganographic method
This paper presents a novel Mod-4 steganographic method in discrete cosine transform (DCT) domain. A group of 2?2 quantized DCT coefficients (GQC) is selected as the valid embeddi...
Xiaojun Qi, KokSheik Wong
86
Voted
ICALT
2003
IEEE
15 years 5 months ago
Real-Time Collaborative Problem Solving: A Study on Alternative Coordination Mechanisms
It is believed that computer-supported collaboration at a distance can stimulate learning. In this paper an innovative environment that permits real-time collaborative problem sol...
Nikolaos M. Avouris, Meletis Margaritis, Vassilis ...
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
15 years 7 months ago
Rank-Pairing Heaps
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
CISC
2007
Springer
129views Cryptology» more  CISC 2007»
15 years 4 months ago
Efficient Public Key Encryption with Keyword Search Schemes from Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu, Heng Pan
107
Voted
IJNSEC
2010
128views more  IJNSEC 2010»
14 years 7 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu