Sciweavers

362 search results - page 43 / 73
» On Bounded-Weight Error-Correcting Codes
Sort
View
ECCC
2010
122views more  ECCC 2010»
14 years 8 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
IPCO
2001
117views Optimization» more  IPCO 2001»
14 years 11 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
EMSOFT
2006
Springer
15 years 1 months ago
Reliability mechanisms for file systems using non-volatile memory as a metadata store
Portable systems such as cell phones and portable media players commonly use non-volatile RAM (NVRAM) to hold all of their data and metadata, and larger systems can store metadata...
Kevin M. Greenan, Ethan L. Miller
ICIP
2008
IEEE
15 years 3 months ago
Macroblock-based retransmission for error-resilient video streaming
This paper revisits the problem of source-channel coding for error-resilient video streaming. We propose a new method to enable adaptive redundancy in the bitstream: fine-grain r...
J. Christian Schmidt, Kenneth Rose
ICPR
2010
IEEE
14 years 7 months ago
Multi-class Graph Boosting with Subgraph Sharing for Object Recognition
In this paper, we propose a novel multi-class graph boosting algorithm to recognize different visual objects. The proposed method treats subgraph as feature to construct base clas...
Bang Zhang, Getian Ye, Yang Wang 0002, Wei Wang, J...