5100 search results - page 637 / 1020 » The Linear Complexity of a Graph |
169
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
155
click to vote
JOC
2008
15 years 6 months ago
2008
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
178
click to vote
MAGS
2008
15 years 6 months ago
2008
Multi-Issue Negotiation protocols have been studied very widely and represent a promising field since most of negotiation problems in the realworld are complex ones including mult...
173
click to vote
EOR
2007
15 years 6 months ago
2007
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
189
click to vote
PAMI
2006
15 years 6 months ago
2006
In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: en...