Sciweavers

4908 search results - page 216 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
PLDI
2012
ACM
13 years 9 months ago
Adaptive input-aware compilation for graphics engines
While graphics processing units (GPUs) provide low-cost and efficient platforms for accelerating high performance computations, the tedious process of performance tuning required...
Mehrzad Samadi, Amir Hormati, Mojtaba Mehrara, Jan...
JC
2007
101views more  JC 2007»
15 years 6 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
QOSA
2010
Springer
15 years 4 months ago
A Hybrid Approach for Multi-attribute QoS Optimisation in Component Based Software Systems
Design decisions for complex, component-based systems impact multiple quality of service (QoS) properties. Often, means to improve one quality property deteriorate another one. In ...
Anne Martens, Danilo Ardagna, Heiko Koziolek, Raff...
TSP
2011
142views more  TSP 2011»
15 years 1 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
TCOM
2010
65views more  TCOM 2010»
15 years 1 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief