Sciweavers

15485 search results - page 76 / 3097
» Computing Optimal Subsets
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 7 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
ICFEM
2009
Springer
13 years 5 months ago
Implementing a Direct Method for Certificate Translation
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
TSP
2010
13 years 2 months ago
Efficient recursive estimators for a linear, time-varying Gaussian model with general constraints
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
Stefan Uhlich, Bin Yang
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 10 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
IPPS
2005
IEEE
14 years 1 months ago
Improving Energy-Efficiency by Bypassing Trivial Computations
We study the energy efficiency benefits of bypassing trivial computations in high-performance processors. Trivial computations are those computations whose output can be determine...
Ehsan Atoofian, Amirali Baniasadi