198 search results - page 23 / 40 » Tensor Rank: Some Lower and Upper Bounds |
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
One of the hard problems in maintaining real-time systems requirements is to keep track of the impact of resource usage on the applications. Often times, it is not sufficient to ...
TIT
1998
14 years 9 months ago
1998
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...
80
Voted
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
TRANSCI
2011
14 years 5 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
91
Voted
CRYPTO
2012
Springer
13 years 17 days ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...