5100 search results - page 321 / 1020 » The Linear Complexity of a Graph |
172
click to vote
TSP
2008
15 years 6 months ago
2008
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
165
click to vote
JSC
2010
15 years 5 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
137
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...
295
click to vote
AWIC
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. In this paper, we introduce DegExt, a graph-based languageindependent keyphrase extractor,which extends the keyword extraction method described in [6]. We compare DegExt ...
183
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...