Sciweavers

1245 search results - page 61 / 249
» Binary Sparse Coding
Sort
View
CPC
2006
110views more  CPC 2006»
15 years 2 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
CISS
2010
IEEE
14 years 6 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
ICPR
2006
IEEE
16 years 3 months ago
ECOC-ONE: A Novel Coding and Decoding Strategy
Error correcting output codes (ECOC) represent a classification technique that allows a successful extension of binary classifiers to address the multiclass problem. In this paper...
Oriol Pujol, Sergio Escalera
DCC
2007
IEEE
15 years 2 months ago
Practical Binary Adaptive Block Coder
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...
Yuriy A. Reznik
FPL
2009
Springer
132views Hardware» more  FPL 2009»
15 years 6 months ago
Binary Synthesis with multiple memory banks targeting array references
High-Level Synthesis (HLS) is the field of transforming a high-level programming language, such as C, into a register transfer level(RTL) description of the design. In HLS, Binary...
Yosi Ben-Asher, Nadav Rotem