We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...
Michael P. McGarry, Martin Reisslein, Frank Aurzad...
People identification has numerous applications, ranging from surveillance/security to robotics. Face and body movement/gait biometrics are the most important tools for this task....
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...