344 search results - page 48 / 69 » The Directed Minimum Latency Problem |
84
Voted
CORR
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
ISBI
2002
IEEE
15 years 10 months ago
2002
IEEE
In magnetic resonance diffusion tensor imaging (DTI), the direction and magnitude of diffusion of water molecules is characterized by a diffusion tensor. In the central nervous sy...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
TROB
2008
14 years 9 months ago
2008
Abstract--In this paper, we investigate different possible strategies underlying the formation of human locomotor trajectories in goal-directed walking. Seven subjects were asked t...
CASES
2009
ACM
14 years 7 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...