TIT
2011
13 years 8 months ago
2011
—In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the netw...
IJRR
2010
14 years 1 days ago
2010
Robots consisting of several concentric, preshaped, elastic tubes can work dexterously in narrow, constrained, and/or winding spaces, as are commonly found in minimally invasive s...
TSMC
1998
14 years 1 months ago
1998
— A new tendency in the design of modern signal processing methods is the creation of hybrid algorithms. This paper gives an overview of different signal processing algorithms si...
DCC
1999
IEEE
14 years 1 months ago
1999
IEEE
Recently, P.J. Cameron studied a class of block designs which generalises the classes of t-designs, -resolved 2-designs, orthogonal arrays, and other classes of combinatorial desi...
DM
1998
14 years 1 months ago
1998
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
ENTCS
2002
14 years 1 months ago
2002
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
ALGORITHMICA
2002
14 years 1 months ago
2002
We consider a special case of the weighted caching problem where
JCT
2008
14 years 1 months ago
2008
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon&...
COMBINATORICS
2007
14 years 1 months ago
2007
Suppose xm + axn is a permutation polynomial over Fp, where p > 5 is prime and m > n > 0 and a ∈ F∗ p. We prove that gcd(m−n, p−1) /∈ {2, 4}. In the special cas...
AML
2006
14 years 1 months ago
2006
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...