Sciweavers

212 search results - page 42 / 43
» On Lengths of Rainbow Cycles
Sort
View
CMOT
2004
141views more  CMOT 2004»
13 years 9 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
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...
Garry Robins, Malcolm Alexander
JCT
2010
79views more  JCT 2010»
13 years 8 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
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
JSAC
2010
101views more  JSAC 2010»
13 years 8 months ago
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays
—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...
ICIP
2010
IEEE
13 years 7 months ago
People identification using shadow dynamics
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....
Yumi Iwashita, Adrian Stoica, Ryo Kurazume
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 4 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
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...