Sciweavers

1332 search results - page 234 / 267
» Combinatorial Algorithms
Sort
View
IGARSS
2009
13 years 5 months ago
Unmixing Sparse Hyperspectral Mixtures
Finding an accurate sparse approximation of a spectral vector described by a linear model, when there is available a library of possible constituent signals (called endmembers or ...
Marian-Daniel Iordache, José M. Bioucas-Dia...
CONSTRAINTS
2011
13 years 2 months ago
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
Scalable constructions of fractional repetition codes in distributed storage systems
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
Joseph C. Koo, John T. Gill III
TIT
2010
97views Education» more  TIT 2010»
13 years 2 months ago
Periodic orbits and equilibria in glass models for gene regulatory networks
Abstract--Glass models are frequently used to model gene regulatory networks. A distinct feature of the Glass model is that its dynamics can be formalized as paths through multi-di...
Igor Zinovik, Yury Chebiryak, Daniel Kroening
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...