Sciweavers

3415 search results - page 358 / 683
» Lower bounds on kernelization
Sort
View
TIT
1998
79views more  TIT 1998»
15 years 6 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
PAMI
2007
125views more  PAMI 2007»
15 years 6 months ago
On the Dimensionality of Face Space
The dimensionality of face space is measured objectively in a psychophysical study. Within this framework we obtain a measurement of the dimension for the human visual system. Usi...
Marsha Meytlis, Lawrence Sirovich
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 5 months ago
Golden Space-Time Block Coded Modulation
In a slow fading MIMO channel, we consider a coded modulation scheme where the inner code is the Golden Code. In this case, a lower bound for the minimum determinant is given by th...
Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude ...
TCOM
2010
80views more  TCOM 2010»
15 years 5 months ago
Near optimal training sequences for low complexity symbol timing estimation in MIMO systems
—Training sequences for data-aided timing estimation in multi-input multi-output systems are designed. It is observed that for low complexity implementation, the sequences must n...
Ketan Rajawat, Ajit K. Chaturvedi
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 5 months ago
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
Karine Altisen, Yanhong Liu, Matthieu Moy