1301 search results - page 104 / 261 » Bounded Version Vectors |
129
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
108
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
100
click to vote
JCT
2007
15 years 20 days ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
111
click to vote
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have rec...
103
Voted
GD
1997
Springer
15 years 5 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...