970 search results - page 48 / 194 » On encodings of spanning trees |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, theoretical results are presented on the modular construction of tree and cascade encoders/decoders of any size for truly asynchronous and orthogonal spectral am...
LCN
2007
IEEE
14 years 3 months ago
2007
IEEE
—The most common technology in Local Area Networks is the Ethernet protocol. The continuing evolution of Ethernet has propelled it into the scope of Metropolitan Area Networks. E...
DM
2006
13 years 8 months ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
ISPD
2010
ACM
14 years 3 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
SSPR
2000
Springer
14 years 10 days ago
2000
Springer
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...