利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

55 条记录 (耗时 0.036 秒)

    System and method for a graph search engine
    1.
    发明授权
    System and method for a graph search engine 有权

    公开(公告)号：US11182396B2

    公开(公告)日：2021-11-23

    申请号：US16025554

    申请日：2018-07-02

    申请人： Palo Alto Research Center Incorporated

    发明人： Ryan A. Rossi ,  Rong Zhou

    IPC分类号： G06F16/2457 ,  G06F16/9535 ,  G06F16/248

    摘要： One embodiment provides a system for facilitating a graph search engine. During operation, the system receives, by a server from a client computing device, a search request which includes a user-inputted graph. The system performs a search based on a structure of the user-inputted graph for a plurality of relevant graphs. The system orders the plurality of relevant graphs from a most relevant ranking to a least relevant ranking. The system returns, to the client computing device, the ordered plurality of relevant graphs for display on a user interface of the client computing device, thereby enhancing the search for relevant graphs by allowing the graph search engine to take as an input the user-inputted graph and return as an output the relevant graphs.

    System And Method For Efficient Sparse Matrix Processing
    3.
    发明申请
    System And Method For Efficient Sparse Matrix Processing 审中-公开

    公开(公告)号：US20170371839A1

    公开(公告)日：2017-12-28

    申请号：US15698547

    申请日：2017-09-07

    申请人： Palo Alto Research Center Incorporated

    发明人： Rong Zhou

    IPC分类号： G06F17/16

    CPC分类号： G06F17/16

    摘要： A system and method for efficient sparse matrix processing are provided in one embodiment. A compressed representation of a sparse matrix, the sparse matrix including one or more non-zero entries in one or more of a plurality of portions of the matrix, is obtained by at least one server including one or more streaming multiprocessors, each of the streaming multiprocessors including one or more graphics processing unit (GPU) processor cores. Each of the portions are assigned into one of a plurality of partitions based on a number of the non-zero entries in that portion. For each of the partitions, a predefined number of the GPU processor cores are assigned for processing each of the portions assigned to that partition based on the numbers of the non-zero entries in the portions assigned to that partition. For each of the partitions, each of the portions associated with that partition are processed.

    FAST AND ACCURATE GRAPHLET ESTIMATION
    4.
    发明申请
    FAST AND ACCURATE GRAPHLET ESTIMATION 审中-公开

    公开(公告)号：US20170357905A1

    公开(公告)日：2017-12-14

    申请号：US15179724

    申请日：2016-06-10

    申请人： Palo Alto Research Center Incorporated

    发明人： Ryan A. Rossi ,  Rong Zhou

    IPC分类号： G06N5/04 ,  G06F17/30

    CPC分类号： G06F16/9024 ,  G06N5/022 ,  G06N7/005

    摘要： Embodiments of the present invention provide a system for fast, accurate, and scalable unbiased graphlet estimation. The system utilizes neighborhood sampling and combinatorial relations to estimate graphlet counts, statistics, and frequency distributions in a small fraction of the computing time of existing systems. The obtained unbiased estimates are highly accurate, and have applications in the analysis, mining, and predictive modeling of massive real-world networks. During operation, the system obtains data indicating vertices and edges of a graph. The system samples a portion of the graph and counts a number of graph features in the sampled portion of the graph. The system then computes an occurrence frequency of a graphlet pattern and a total number of graphlets associated with the graphlet pattern in the graph.

    Computer-implemented system and method for efficient sparse matrix representation and processing
    5.
    发明授权
    Computer-implemented system and method for efficient sparse matrix representation and processing 有权

    公开(公告)号：US09760538B2

    公开(公告)日：2017-09-12

    申请号：US14580110

    申请日：2014-12-22

    申请人： Palo Alto Research Center Incorporated

    发明人： Rong Zhou

    IPC分类号： G06F17/16

    CPC分类号： G06F17/16

    摘要： Speed with which sparse matrices are processed can be increased by using improved compressed representations of the matrices. Structured compressed representations reduce the number of cache misses experienced during matrix processing by decreasing the number of times the cache has to be accessed randomly. Further, representations of the matrix that divide and regroup rows and columns of the matrix based on their number of non-zero entries allows to assign the most appropriate kernel function for processing of these portions of a matrix, overcoming the limitations of the GPU-based hardware. As a result, the speed of processing can be increased without disturbing the original structure of the matrix.

    SYSTEM AND METHOD FOR A HIGH-PERFORMANCE GRAPH ANALYTICS ENGINE
    6.
    发明申请
    SYSTEM AND METHOD FOR A HIGH-PERFORMANCE GRAPH ANALYTICS ENGINE 有权
    高性能图分析发动机的系统和方法

    公开(公告)号：US20150095182A1

    公开(公告)日：2015-04-02

    申请号：US14039941

    申请日：2013-09-27

    申请人： Palo Alto Research Center Incorporated

    发明人： Rong Zhou ,  Daniel Davies

    IPC分类号： G06Q30/06

    CPC分类号： G06Q30/0631 ,  H04N21/4668

    摘要： One embodiment of the present invention provides a system for generating a product recommendation. During operation, the system receives graph data indicating vertices and edges of the graph. The vertices represent customers and products and the edges represent purchases. The system then receives a query of the graph to determine a product recommendation. Next, the system generates a finite-state machine (FSM) based on the query, executes the query, and determines whether a current state of the FSM is a traversal state. In response to the current state being a traversal state, the system generates a traversal FSM. The system then searches the traversal FSM for a nearest future traversal state, generates a bitmask for the future traversal state, and utilizes the generated bitmask when executing the future traversal state to generate the product recommendation.

    摘要翻译： 本发明的一个实施例提供了一种用于产生产品推荐的系统。 在操作期间，系统接收指示图形的顶点和边缘的图形数据。 顶点代表客户和产品，边缘代表购买。 然后，系统接收图形的查询以确定产品推荐。 接下来，系统基于查询生成有限状态机（FSM），执行查询，并确定FSM的当前状态是否为遍历状态。 响应于当前状态是遍历状态，系统生成遍历FSM。 然后系统搜索遍历FSM以获得最近的未来遍历状态，为未来的遍历状态生成位掩码，并在执行未来遍历状态时利用生成的位掩码来生成产品推荐。

    SYSTEM AND METHOD FOR HYBRID TASK MANAGEMENT ACROSS CPU AND GPU FOR EFFICIENT DATA MINING
    10.
    发明申请
    SYSTEM AND METHOD FOR HYBRID TASK MANAGEMENT ACROSS CPU AND GPU FOR EFFICIENT DATA MINING 审中-公开

    公开(公告)号：US20180365019A1

    公开(公告)日：2018-12-20

    申请号：US15628153

    申请日：2017-06-20

    申请人： Palo Alto Research Center Incorporated

    发明人： Ryan A. Rossi ,  Rong Zhou

    IPC分类号： G06F9/38 ,  G06F17/30

    CPC分类号： G06F9/3877 ,  G06F17/30539

    摘要： Embodiments described herein provide a system for facilitating hybrid task management across a central processing unit (CPU) and a graphics processing unit (GPU) of a computer. During operation, the system determines a set of tasks for performing data mining on a data set and storing the set of tasks in a data structure in an ascending order of uniformity associated with a respective task. The uniformity of a task indicates how uneven and skewed the task is compared to other tasks in the set of tasks. The system then allocates a subset of tasks to a core of the CPU from a front of the data structure and a subset of tasks to a core of the GPU from a back of the data structure.