Sciweavers

2095 search results - page 256 / 419
» Improved pebbling bounds
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
DM
2008
114views more  DM 2008»
15 years 6 months ago
Subdivisions of graphs: A generalization of paths and cycles
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
Ch. Sobhan Babu, Ajit A. Diwan
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
ETT
2006
102views Education» more  ETT 2006»
15 years 6 months ago
Bit-interleaved coded irregular modulation
We consider a simple method to improve the adaptiveness and flexibility of bit-interleaved coded modulation (BICM) for various channel models. With state-of-the art adaptive transm...
Frank Schreckenbach, Gerhard Bauch
IJISTA
2008
95views more  IJISTA 2008»
15 years 6 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach