Sciweavers

2774 search results - page 442 / 555
» Exploiting Deep Structure
Sort
View
CODES
2005
IEEE
15 years 6 months ago
An efficient direct mapped instruction cache for application-specific embedded systems
Caches may consume half of a microprocessor’s total power and cache misses incur accessing off-chip memory, which is both time consuming and energy costly. Therefore, minimizing...
Chuanjun Zhang
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 6 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
CISS
2007
IEEE
15 years 6 months ago
A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes
— In this paper, we present a simple technique to approximate the performance union bound of a punctured turbo code. The bound approximation exploits only those terms of the tran...
Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ia...
CONCUR
2008
Springer
15 years 6 months ago
Unfolding-Based Diagnosis of Systems with an Evolving Topology
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara...
CPAIOR
2008
Springer
15 years 6 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman