Sciweavers

1464 search results - page 133 / 293
» On optimal anonymization for l -diversity
Sort
View
JMLR
2010
84views more  JMLR 2010»
15 years 1 months ago
Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these mo...
Sham Kakade, Ohad Shamir, Karthik Sindharan, Ambuj...
SIAMMA
2010
63views more  SIAMMA 2010»
15 years 1 months ago
Sparse Tensor Product Wavelet Approximation of Singular Functions
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...
Monique Dauge, Rob Stevenson
AIPS
2011
14 years 10 months ago
Sample-Based Planning for Continuous Action Markov Decision Processes
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
Christopher R. Mansley, Ari Weinstein, Michael L. ...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CLUSTER
2008
IEEE
16 years 29 days ago
A trace-driven emulation framework to predict scalability of large clusters in presence of OS Jitter
—Various studies have pointed out the debilitating effects of OS Jitter on the performance of parallel applications on large clusters such as the ASCI Purple and the Mare Nostrum...
Pradipta De, Ravi Kothari, Vijay Mann