14699 search results - page 412 / 2940 » Complexity and Cognitive Computing |
139
click to vote
CSC
2008
15 years 6 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
118
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
155
click to vote
TCOM
2010
15 years 3 months ago
2010
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...
145
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
130
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...