公开(公告)号：US11734341B2

公开(公告)日：2023-08-22

申请号：US17070738

申请日：2020-10-14

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huajingling Wu ,  Tingrui Han ,  Ningxi Ni ,  Lele Wang ,  Zhenli Sheng

IPC: G06F16/00 ,  G06F16/583 ,  G06F16/906 ,  G06F16/903 ,  G06F16/908 ,  G06F18/213 ,  G06N3/04

CPC classification number: G06F16/583 ,  G06F16/906 ,  G06F16/908 ,  G06F16/90335 ,  G06F18/213 ,  G06N3/04

Abstract: An information processing method is disclosed. The method includes: obtaining initial feature information of to-be-queried information; performing feature processing on the initial feature information of the to-be-queried information, to obtain target feature information of the to-be-queried information, where the feature processing includes at least feature dimension processing used to process a data dimension of the initial feature information of the to-be-queried information to be a preset dimension; performing a first retrieval operation on m pieces of candidate information based on the target feature information of the to-be-queried information, to obtain a first retrieval result; and performing a second retrieval operation on the first retrieval result based on the initial feature information of the to-be-queried information, to obtain result information corresponding to the to-be-queried information. The method can quickly and efficiently implement information retrieval.

公开(公告)号：US11252076B2

公开(公告)日：2022-02-15

申请号：US16522065

申请日：2019-07-25

Applicant: Huawei Technologies Co., Ltd.

Inventor： Zhenli Sheng ,  Rongfeng Huang ,  Fan Yu

IPC: H04L12/701 ,  H04L12/721

Abstract: The method includes: forwarding, based on path sets of nodes in a network, service data between a source node and a sink node in the network, where the path sets of the nodes in the network are determined by iteratively performing the following path set determining step: for each link in the network, obtaining a path set of a start node of the link, and determining N shortest paths from an end node of the link to the sink node; and for each path included in the path set of the start node, determining, according to the N shortest paths, the path, and the link, to add a new path formed by the path and the link into a path set of the end node.