Sciweavers

128 search results - page 13 / 26
» Partitioning a weighted partial order
Sort
View
IAJIT
2008
134views more  IAJIT 2008»
13 years 7 months ago
A Dynamic Traffic Shaping Technique for a Scalable QoS in ATM Networks
: Traffic shaping function becomes imperative for the new broadband services that are being deployed in order to avoid information loss, to provide the end users multiple traffic o...
Francis Joseph Ogwu, Mohammad Talib, Ganiyu Aderou...
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
13 years 7 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos
JCT
2008
103views more  JCT 2008»
13 years 7 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
TCOM
2011
114views more  TCOM 2011»
13 years 2 months ago
Iterative Receivers Based on Subblock Processing for Phase Noise Compensation in OFDM Systems
—An iterative algorithm employing decision feedback provided by either an equalizer or a channel decoder is proposed in order to compensate for the phase noise resulting from imp...
Myung-Kyu Lee, Kyeongcheol Yang, Kyungwhoon Cheun
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch