Sciweavers

4908 search results - page 125 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
TIT
2010
154views Education» more  TIT 2010»
15 years 1 months ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...
TSP
2010
15 years 1 months ago
A recursive method for the approximation of LTI systems using subband processing
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Damián Marelli, Minyue Fu
ECAI
2004
Springer
15 years 11 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
15 years 10 months ago
PSO and multi-funnel landscapes: how cooperation might limit exploration
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...
Andrew M. Sutton, Darrell Whitley, Monte Lunacek, ...
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite