Sciweavers

1763 search results - page 141 / 353
» Dependent random choice
Sort
View
DCC
2008
IEEE
14 years 8 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
CISS
2008
IEEE
14 years 2 months ago
Sum transmission power of multiple cooperative secondary transmitters in dynamic spectrum access networks
Cognitive radio is a desirable technique for secondary users to utilize the spectrum gray space. In order to avoid intolerable interference to primary users, the transmission powe...
Juite Hwu, Jinying Chen, Xiaohua Li
ICMCS
2007
IEEE
134views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Cryptanalysis of a Video Scrambling Based on Space Filling Curves
In this paper, we study the security of an image scrambling algorithm based on Space-Filling Curves (SFC). A random SFC is a pixel permutation that changes the scanning order with...
Ayoub Massoudi, Frédéric Lefè...
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
14 years 2 months ago
Resolution Scalable Coding and Region of Interest Access with Three-Dimensional SBHP Algorithm
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
Ying Liu, William A. Pearlman
INFOCOM
2006
IEEE
14 years 2 months ago
Optimal Hopping in Ad Hoc Wireless Networks
— Gupta and Kumar showed that throughput in a static random wireless network increases with the amount of hopping. In a subsequent paper (2004), it was shown that although throug...
Abbas El Gamal, James P. Mammen