2095 search results - page 263 / 419 » Improved pebbling bounds |
193
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
184
Voted
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
208
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
166
click to vote
MOC
2011
15 years 1 months ago
2011
Abstract. Local energy error estimates for the finite element method for elliptic problems were originally proved in 1974 by Nitsche and Schatz. These estimates show that the loca...
186
click to vote
TCOM
2011
15 years 1 months ago
2011
—An improved concatenated code structure, which generalizes parallel and serially concatenated convolutional codes is presented and investigated. The structure is ideal for desig...