Sciweavers

3240 search results - page 125 / 648
» Pre-aggregation with probability distributions
Sort
View
ICIP
2005
IEEE
14 years 4 months ago
Minmax strategies for QIM watermarking subject to attacks with memory
This paper examines the role of attacker’s memory in Quantization Index Modulation (QIM) watermarking systems. First we derive the attacker’s noise distribution that maximizes...
Pierre Moulin, Anil Kumar Goteti
ECSQARU
2003
Springer
14 years 3 months ago
A Representation Theorem and Applications
We introduce a set of transformations on the set of all probability distributions over a finite state space, and show that these transformations are the only ones that preserve c...
Manfred Jaeger
OL
2011
190views Neural Networks» more  OL 2011»
13 years 5 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 4 months ago
Unwitting distributed genetic programming via asynchronous JavaScript and XML
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
Jon Klein, Lee Spector