Sciweavers

307 search results - page 21 / 62
» Efficient error estimating coding: feasibility and applicati...
Sort
View
IPCO
2001
117views Optimization» more  IPCO 2001»
14 years 10 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
104
Voted
CODES
2005
IEEE
15 years 3 months ago
High-level synthesis for large bit-width multipliers on FPGAs: a case study
In this paper, we present the analysis, design and implementation of an estimator to realize large bit width unsigned integer multiplier units. Larger multiplier units are require...
Gang Quan, James P. Davis, Siddhaveerasharan Devar...
IH
2007
Springer
15 years 3 months ago
YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis
Abstract. A new, simple, approach for active steganography is proposed in this paper that can successfully resist recent blind steganalysis methods, in addition to surviving distor...
Kaushal Solanki, Anindya Sarkar, B. S. Manjunath
82
Voted
ICIP
2006
IEEE
15 years 3 months ago
Low-Complexity Rate Control for Efficient H.263 to H.264/AVC Video Transcoding
Rate control is a complicated problem in the H.264/AVC coding standard, extra computation is usually needed for the existing rate control schemes to estimate the complexity of fra...
Chi-Wang Ho, Oscar C. Au, S.-H. Gary Chan, Shu-Kei...
NIPS
2008
14 years 11 months ago
Differentiable Sparse Coding
Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian (L1) that...
J. Andrew Bagnell, David M. Bradley