公开(公告)号：US11281726B2

公开(公告)日：2022-03-22

申请号：US15997548

申请日：2018-06-04

Applicant: Palantir Technologies Inc.

Inventor： Christopher Martin ,  Abdulaziz Alghunaim ,  Sri Krishna Vempati

IPC: G06F16/9032 ,  G06F16/901 ,  G06F17/14 ,  G06F17/18 ,  G06K9/00 ,  G06K9/62

Abstract: Techniques allow a computer to responsively search for graph shapes similar to a user-selected graph shape much faster. Data can be pre-processed and stored as vectors, along with an index. The index can be used to find similar vectors that represent graph shapes similar to a user-selected shape in a computationally efficient manner. Vectors of multiple resolutions can be used to anticipate different sizes of a graph that a user can select, and comparisons can be repeated and refined. When a satisfactorily small number of candidate vectors are determined, more computationally intensive distance calculations can be performed on data reconstructed from the vectors.

公开(公告)号：US20220164394A1

公开(公告)日：2022-05-26

申请号：US17650923

申请日：2022-02-14

Applicant: Palantir Technologies Inc.

Inventor： Christopher Martin ,  Abdulaziz Alghunaim ,  Sri Krishna Vempati

IPC: G06F16/9032 ,  G06K9/00 ,  G06F16/901 ,  G06F17/14 ,  G06F17/18 ,  G06K9/62

Abstract: Techniques allow a computer to responsively search for graph shapes similar to a user-selected graph shape much faster. Data can be pre-processed and stored as vectors, along with an index. The index can be used to find similar vectors that represent graph shapes similar to a user-selected shape in a computationally efficient manner. Vectors of multiple resolutions can be used to anticipate different sizes of a graph that a user can select, and comparisons can be repeated and refined. When a satisfactorily small number of candidate vectors are determined, more computationally intensive distance calculations can be performed on data reconstructed from the vectors.

公开(公告)号：US12099570B2

公开(公告)日：2024-09-24

申请号：US17650923

申请日：2022-02-14

Applicant: Palantir Technologies Inc.

Inventor： Christopher Martin ,  Abdulaziz Alghunaim ,  Sri Krishna Vempati

IPC: G06F16/901 ,  G06F16/9032 ,  G06F17/14 ,  G06F17/18 ,  G06F18/00 ,  G06F18/2413

CPC classification number: G06F18/00 ,  G06F16/901 ,  G06F16/90328 ,  G06F17/14 ,  G06F17/18 ,  G06F18/24147 ,  G06F2218/08 ,  G06F2218/16

Abstract: Techniques allow a computer to responsively search for graph shapes similar to a user-selected graph shape much faster. Data can be pre-processed and stored as vectors, along with an index. The index can be used to find similar vectors that represent graph shapes similar to a user-selected shape in a computationally efficient manner. Vectors of multiple resolutions can be used to anticipate different sizes of a graph that a user can select, and comparisons can be repeated and refined. When a satisfactorily small number of candidate vectors are determined, more computationally intensive distance calculations can be performed on data reconstructed from the vectors.

公开(公告)号：US20190171775A1

公开(公告)日：2019-06-06

申请号：US15997548

申请日：2018-06-04

Applicant: Palantir Technologies Inc.

Inventor： Christopher Martin ,  Abdulaziz Alghunaim ,  Sri Krishna Vempati

IPC: G06F17/30 ,  G06F17/14 ,  G06F17/18 ,  G06K9/62

Abstract: Techniques allow a computer to responsively search for graph shapes similar to a user-selected graph shape much faster. Data can be pre-processed and stored as vectors, along with an index. The index can be used to find similar vectors that represent graph shapes similar to a user-selected shape in a computationally efficient manner. Vectors of multiple resolutions can be used to anticipate different sizes of a graph that a user can select, and comparisons can be repeated and refined. When a satisfactorily small number of candidate vectors are determined, more computationally intensive distance calculations can be performed on data reconstructed from the vectors.