113 search results - page 1 / 23 » When can a graph form an orthogonal polyhedron |
CCCG
2004
13 years 8 months ago
2004
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
— Despite significant research efforts, closed-form bit error rate (BER) expressions for multiple-input multiple-output (MIMO) systems employing transmit antenna selection and o...
COMPGEOM
2003
ACM
14 years 18 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
EJC
2011
13 years 2 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
TWC
2008
13 years 7 months ago
2008
In this paper, the statistics of quadratic forms in normal random variables (RVs) are studied and their impact on performance analysis of wireless communication systems is explored...