知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

1771 records (took 0.044 seconds)

    Efficiently executing commands at external computing services
    31.
    发明授权
    Efficiently executing commands at external computing services 有权

    公开(公告)号：US11537951B2

    公开(公告)日：2022-12-27

    申请号：US17146339

    申请日：2021-01-11

    Applicant: SPLUNK INC.

    Inventor： Lin Ma ,  Jacob Leverich ,  Adam Oliner ,  Alex Cruise ,  Hongyang Zhang

    IPC: G06F7/08 ,  G06N20/00 ,  H04L67/10 ,  H04L9/40 ,  G06F16/28 ,  G06F16/951 ,  G06F16/2455 ,  G06F16/903 ,  H04L41/14

    Abstract: Embodiments of the present invention are directed to facilitating distributed data processing for machine learning. In accordance with aspects of the present disclosure, a set of commands in a query to process at an external computing service is identified. For each command in the set of commands, at least one compute unit including at least one operation to perform at the external computing service is identified. Each of the at least one compute unit associated with each command is analyzed to identify an optimized manner in which to execute the set of commands at the external computing service. An indication of the optimized manner in which to execute the set of commands and a corresponding set of data is provided to the external computing service to utilize for executing the set of commands at the external computing service.

    Extensible version history and comparison within a backup
    32.
    发明授权
    Extensible version history and comparison within a backup 有权

    公开(公告)号：US11531659B2

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

    申请号：US16914773

    申请日：2020-06-29

    Applicant: EMC IP Holding Company LLC

    Inventor： James Morton ,  Lihui Su ,  Gerald Jourdain ,  Ming Zhang

    IPC: G06F16/00 ,  G06F16/21 ,  G06F7/08

    Abstract: Described is a system for providing quick and efficient identification of a desired version of content from an editing history of the content. The system receives a search index identifying versions of content from an editing history of the content. The system sorts the search index according to sort criteria and receives a selection from the sorted search index of a first version of the content and a second version of the content. The system identifies and displays one or more content differences between the first and second versions of the content.

    Unsupervised dialogue topic extraction
    33.
    发明授权
    Unsupervised dialogue topic extraction 有权

    公开(公告)号：US11507617B2

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

    申请号：US16685933

    申请日：2019-11-15

    Applicant: salesforce.com, inc.

    Inventor： Zachary Alexander ,  Na Cheng

    IPC: G06F16/61 ,  G06F40/30 ,  G06F7/08

    Abstract: Disclosed are some implementations of systems, apparatus, methods and computer program products for extracting topics from a corpus of exchanges. The system generates vector representations of utterances of an entity common to the exchanges and uses the vector representations to cluster the utterances. The system labels the clusters and uses the labeled clusters to generate an exchange label sequence for each of the exchanges, where each exchange label sequence corresponds to a sequence of utterances generated by the entity. The system processes the exchange label sequences to generate one or more subsets of the utterances, where each of the subsets corresponds to a particular topic.

    MERGING MULTIPLE SORTED LISTS IN A DISTRIBUTED COMPUTING SYSTEM
    34.
    发明申请
    MERGING MULTIPLE SORTED LISTS IN A DISTRIBUTED COMPUTING SYSTEM 有权

    公开(公告)号：US20220334796A1

    公开(公告)日：2022-10-20

    申请号：US17717999

    申请日：2022-04-11

    Applicant: Cloudera, Inc.

    Inventor： Adar Lieber-Dembo ,  Todd Lipcon

    IPC: G06F7/08 ,  G06F16/22

    Abstract: A technique is described for merging multiple lists of ordinal elements such as keys into a sorted output. In an example embodiment, a merge window is defined, based on the bounds of the multiple lists of ordinal elements, that is representative of a portion of an overall element space associated with the multiple lists. Lists of elements to be sorted can be placed into one of at least two different heaps based on whether they overlap the merge window. For example, lists that overlap the merge window may be placed into an active or “hot” heap, while lists that do not overlap the merge window may be placed into a separate inactive or “cold” heap. A sorted output can then be generated by iteratively processing the active heap. As the processing of the active heap progresses, the merge window advances, and lists may move between the active and inactive heaps.

    Promoting Communicant Interactions in a Network Communications Environment
    35.
    发明申请
    Promoting Communicant Interactions in a Network Communications Environment 有权

    公开(公告)号：US20220292732A1

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

    申请号：US17831369

    申请日：2022-06-02

    Applicant: Sococo, Inc.

    Inventor： Matthew Leacock ,  David Van Wie ,  Paul J. Brody

    IPC: G06T11/00 ,  G06F16/44 ,  G06F3/04815 ,  H04L51/043 ,  G06F3/0481 ,  G06F40/134 ,  G06F40/166 ,  G06F40/274 ,  H04L67/54 ,  G06F3/0482 ,  G06F3/04842 ,  G06F3/04845 ,  G06F7/08 ,  H04L67/10

    Abstract: In a network communications environment supporting realtime communications between respective network nodes of a user and other communicants in virtual areas each of which is associated with its own respective set of communicant members, a graphical user interface is provided in connection with the user's network node. The graphical user interface includes controls for establishing presence in respective ones of the virtual areas, managing realtime communications with other communicants in respective ones of the virtual areas, and presenting different views of communicants associated with the network communications environment. Based on user input in connection with the graphical user interface, a presence is established for the user in a selected one of the virtual areas, realtime communications are administered between the user and one or more communicants who are present in the selected virtual area, and a visualization that shows graphical representations, locations of presence, and realtime activities of communicants across respective ones of the virtual areas is displayed.

    Ranking datasets based on data attributes
    38.
    发明授权
    Ranking datasets based on data attributes 有权

    公开(公告)号：US11436237B2

    公开(公告)日：2022-09-06

    申请号：US17125935

    申请日：2020-12-17

    Applicant: International Business Machines Corporation

    Inventor： Manjit Singh Sodhi ,  Kalapriya Kannan ,  Poornima Iyengar

    IPC: G06F7/08 ,  G06F16/2457

    Abstract: Ranking a group of datasets using a computer includes determining a set of target data fields from a set of process documents that indicate user data field preferences. A set of target dataset attributes from a set of data use documents indicate user data scope preferences. A plurality of metadata sets for an associated plurality of datasets the computer determines having a field suitability value exceeding a predetermined suitability threshold value. The FSV represents a degree of similarity between a set of fields associated with said dataset and the set of target data fields. The computer assesses metadata sets with regard to the target attributes and generates a compared attribute score for each candidate dataset. A degree of likelihood is indicated that an associated dataset will have content exhibiting said target dataset attributes. The computer candidate datasets is based on the compared attribute score.

    Methods and systems for preloading applications and generating prediction models
    39.
    发明授权
    Methods and systems for preloading applications and generating prediction models 有权

    公开(公告)号：US11429880B2

    公开(公告)日：2022-08-30

    申请号：US16110359

    申请日：2018-08-23

    Applicant: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.

    Inventor： Yan Chen

    IPC: G06N5/04 ,  G06F9/445 ,  G06N20/00 ,  G06F7/08

    Abstract: An application preloading method and apparatus, and a prediction model generation method and apparatus are described. Application preloading may include obtaining application usage state information of a terminal and contextual information of the terminal; inputting the obtained application usage state information and contextual information into a pre-generated prediction model that is configured for predicting application startup and for calculating at least one prediction value for the application startup; determining an application to be started according to the at least one prediction value, and preloading the application to be started. The prediction model may be pre-generated according to usage association information of applications within a predetermined time period and contextual information of the terminal corresponding to the usage association information.

    SELECTING PARTITIONS FOR RECLUSTERING BASED ON DISTRIBUTION OF OVERLAPPING PARTITIONS
    40.
    发明申请
    SELECTING PARTITIONS FOR RECLUSTERING BASED ON DISTRIBUTION OF OVERLAPPING PARTITIONS 有权

    公开(公告)号：US20220197886A1

    公开(公告)日：2022-06-23

    申请号：US17654296

    申请日：2022-03-10

    Applicant: Snowflake Inc.

    Inventor： Jiaqi Yan ,  Thierry Cruanes ,  Jeffrey Rosen ,  William Waddington ,  Prasanna Rajaperumal ,  Abdul Munir

    IPC: G06F16/22 ,  G06F16/27 ,  G06F7/08 ,  G06F16/28

    Abstract: Disclosed herein are embodiments of systems and methods for selecting partitions for reclustering based on distribution of overlapping partitions. In an example, a database platform makes a determination to at least partially recluster a database table that includes data stored across a plurality of partitions. The database platform responsively selects a subset of the partitions. The selecting of the subset includes identifying a point on a domain of a clustering key that corresponds to a local maximum of overlapping partitions, and also includes selecting the subset from among a group of overlapping partitions. The group includes at least one partition that overlaps the identified point on the domain of the clustering key. Each partition in the selected subset is above a reduction goal of overlapping partitions. The database platform at least partially reclusters the selected subset based on the clustering key.

Patent Agency Ranking