Sciweavers

2259 search results - page 277 / 452
» Separation and information hiding
Sort
View
IANDC
2006
77views more  IANDC 2006»
15 years 6 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 6 months ago
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
—Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading r...
Yingbin Liang, Venugopal V. Veeravalli, H. Vincent...
TSMC
2008
100views more  TSMC 2008»
15 years 6 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 5 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
JCNS
2010
119views more  JCNS 2010»
15 years 4 months ago
Disentanglement of local field potential sources by independent component analysis
The spontaneous activity of working neurons yields synaptic currents that mix up in the volume conductor. This activity is picked up by intracerebral recording electrodes as local ...
Valeri A. Makarov, Ioulia Makarova, Oscar Herreras