841 search results - page 76 / 169 » Constructions for Clumps Statistics |
102
click to vote
CODCRY
2009
Springer
15 years 6 months ago
2009
Springer
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
IDA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of fac...
ESEM
2009
ACM
15 years 6 months ago
2009
ACM
This article describes a survey which aims to identify the relative importance of a set of factors that affect the motivation of software engineers at work. The conceptual underpi...
105
click to vote
ICMCS
2008
IEEE
15 years 6 months ago
2008
IEEE
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
111
click to vote
SIBGRAPI
2008
IEEE
15 years 6 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...