Examples of using A data structure in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
This thesis has the overall objective to analyze the tourism potential by means of a data structure, based on the associated tourism production,
Therefore, the aim of this study is to offer an inducting model based on a data structure and classifying algorithm that is responsible for labelling financial activities with suspicious money laundering characteristics under the brazilian law.
They are particularly useful when dealing with repeated measures with data not equally spaced in time, a data structure which is very common in public health,
the document received by the EDI solution is transformed into a data structure that can be processed by the ERP.
as well as what's going on under the hood in a typical implementation of such a data structure.>> There's a number of important concepts in the design and analysis of algorithms that we won't have time to cover in this five week course.
A data structure's responsible for organizing data in a way that supports fast queries.
The component tree is a data structure that represents an image through the hierarchical relationship of its connected components.
It is a data structure used, among others, in full text indices,
In computer science, a data structure is a particular way of organizing data in a computer
The PE format is a data structure that encapsulates the information necessary for the Windows OS loader to manage the wrapped executable code.
produce a data structure that efficiently tells which object a query ray intersects first.
is a data structure in Win32 on x86 that stores information about the currently running thread.
the concept of transitive closure can be thought of as constructing a data structure that makes it possible to answer reachability questions.
Data structure===In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently.
Kirkpatrick gives a data structure for point location in triangulated subdivisions with O("n")
produce a data structure that efficiently tells in which cell a query point is located.
it was used a data structure to manipulate graphs producing exclusively radial
Generalized Search Tree, is a data structure and API that can be used to build a variety of disk-based search trees.
In computer file systems, a block availability map(BAM) is a data structure used to track disk blocks that are considered free available for new data. .
the concept of transitive closure can be thought of as constructing a data structure that makes it possible to answer reachability questions.