Sciweavers

2283 search results - page 334 / 457
» Bounds of Graph Characteristics
Sort
View
TCOM
2011
129views more  TCOM 2011»
13 years 3 months ago
On the Capacity of WDM Passive Optical Networks
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
Jingjing Zhang, Nirwan Ansari
SIAMCO
2010
127views more  SIAMCO 2010»
13 years 2 months ago
Tracking with Prescribed Transient Performance for Hysteretic Systems
Tracking of reference signals (assumed bounded with essentially bounded derivative) is considered for a class of single-input, single-output, nonlinear systems, described by a func...
Achim Ilchmann, Hartmut Logemann, Eugene P. Ryan
TCS
2010
13 years 2 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
INFOCOM
2011
IEEE
12 years 11 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 5 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos