A descriptor is a specialized representation for doing useful tasks on images and other data structures.

描述符是对图像或是其他构做有的一种专门的表述。

So the question immediately arises: what kind of data structure should be used for the output?

应该在输出中采哪种构？

In China and Singapore the data structure for doing this is highly centralized.

在中国和新加坡，这样做的构是高度集中的。

It was the second class data structures.

它是第二门构课程。

So there are data structures that sort of grow this way.

因此，存在这样一种构，它们以某种方式逐渐增长。

Yeah, so knowledge graphs are data structures that allow you to semantically model complex relationships.

是的，知识图是一种构，它允许你以语义方式建模复杂关系。

I think they're an amazing data structure for condensing information.

我认为它们是压缩信息的绝佳构。

So the elegance of the NumPy data structure, like slicing through the different multi-dimensional.

NumPy构的优雅之，比如在不同多维组间进行切片操作。

I love thinking in terms of the matrices and the vectors and these kind of data structures.

我喜欢矩阵和向量以及这类构来思考。

A data structure that is used for intertask synchronization. Semaphores are usually provided by the operating system.

于进程间同步的构。信号灯常常由操作系统提供。

And with code, well, developers have to think about all their data structures and allocating memory correctly.

而对于代码，开发者则需精心考虑其所有构，并确保内存分配得当。

And Git, even though it is ironically based on immutable data structures, works more like the latter.

而 Git 虽然讽刺的是基于不可变构，却更像后者那样工作。

Always love the puzzles of algorithms, of data structures, of proving various things about algorithms.

总是喜欢算法、构以及证明各种算法特性的难题。

So I had to rewrite how we do the data structure on the front end for the TV.

因此，我不得不重新编写我们在电视前端构的方式。

For data that links arbitrarily, that include things like loops, we can use a graph data structure instead.

对于任意链接的，包括像环这样的构，我们可以使图构。

So that's a whirlwind overview of pretty much all of the fundamental data structures used in computer science.

所以这就是计算机科学中几乎所有基本构的快速概述。

In this case, let's imagine all the users' data is stored in a data structure called a table labeled " users" .

在这种情况下，假设所有户的资料都存储在一个称为“户”表的构中。

In our example, nodes can have up to two children, and for that reason, this particular data structure is called a binary tree.

在我们的示例中，节点最多可以有两个子节点，因此这种构被称为二叉树。

But you could just as easily have trees with three, four or any number of children by modifying the data structure accordingly.

但你可以通过相应地修改构，轻松拥有三个、四个或任意量子节点的树。

But, the struct data structure can be used for building more complicated data structures that avoid these restrictions.

但是，构体构可以来构建更复杂的构，从而避免这些限制。