Sciweavers

43 search results - page 6 / 9
» Optimal probabilistic fingerprint codes
Sort
View
EUROPAR
2003
Springer
14 years 1 months ago
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool
ATAL
2008
Springer
13 years 10 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 8 months ago
Access-Network Association Policies for Media Streaming in Heterogeneous Environments
Abstract--We study the design of media streaming applications in the presence of multiple heterogeneous wireless access methods with different throughputs and costs. Our objective ...
Ali ParandehGheibi, Muriel Médard, Asuman E...
INFOCOM
2003
IEEE
14 years 1 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
JMLR
2010
163views more  JMLR 2010»
13 years 3 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray