Sciweavers

1763 search results - page 90 / 353
» Dependent random choice
Sort
View
ICIP
2001
IEEE
14 years 10 months ago
Geometric hashing techniques for watermarking
In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techn...
Hagit Zabrodsky Hel-Or, Y. Yitzhaki, Yacov Hel-Or
CEC
2005
IEEE
14 years 2 months ago
Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
Shengxiang Yang
CORR
2007
Springer
90views Education» more  CORR 2007»
13 years 9 months ago
Rateless coding with partial state information at the decoder
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
Anand D. Sarwate, Michael Gastpar
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 10 months ago
A Framework for High-Accuracy Privacy-Preserving Mining
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
Shipra Agrawal, Jayant R. Haritsa