Login or register (free and only takes a few minutes) to participate in this question.
You will also have access to many other tools and opportunities designed for those who have language-related jobs (or are passionate about them). Participation is free and the site has a strict confidentiality policy.
English to Spanish translations [PRO] Tech/Engineering
English term or phrase:tent element
Se trata de un artículo sobre matemáticas:
"By finite support, I mean that the amplitude of a given element is zero on all nodes except one, where it is unity. This ensures that the amplitude Vj coincides with the numerical value of v(x,y) on node j. Figure 3 is one such tent element."
Explanation: I don't know the answer, but I found this page, which explains what the tent element is, perhaps it would help you:
Let dist(s; v) denote the length of the shortest path from s to v.
0.1.2 Dijkstra's Algorithm We will now discuss the most widely used algorithm for computing shortest paths. It is remarkabely simple. In particular because we already know graph exploration and breadth first search. The algorithm is still almost a graph exploration algorithm. The main difference is that we maintain an additional array tent that stores the tentative distance of all nodes -- an upper bound for dist(s; v). The tentative distance of a node v is not only set when a node is first encountered but whenever an edge (u; v) entering v is inspected. When the tentative distance changes, the parent pointers are also updated so that they can be used to construct paths of the length stored in tent . Finally, the algorithm does not remove arbitrary nodes from todo but those with minimum tentative distance.
Before discussing why this computes shortest paths lets summarize this in pseudo-code: (* Find shortest paths from s *) tent := h1; : : : ; 1i todo := fsg parent [s] := s - - sentinel tent [s] := 0 (* Invariant: If tent[v] ! 1, it stores the length of the path defined by following
parent pointers. If, additionally, v 62 todo then tent [v] = dist(s; v).