中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

733 records (took 0.024 seconds)

    SYSTEMS AND METHODS FOR PREDICTING AND MITIGATING OUT OF MEMORY KILLS
    311.
    发明公开
    SYSTEMS AND METHODS FOR PREDICTING AND MITIGATING OUT OF MEMORY KILLS 审中-公开

    公开(公告)号：US20240028432A1

    公开(公告)日：2024-01-25

    申请号：US18354582

    申请日：2023-07-18

    Applicant: Netflix, Inc.

    Inventor： Andrew David Eichacker ,  Anselm Lau ,  Aryan Mehra ,  Jason Nicholas Munning ,  Farnaz Karimdady Sharifabad ,  Prasanna Vijayanathan ,  Chaïna Wade

    IPC: G06F11/00 ,  G06F9/50

    CPC classification number: G06F11/008 ,  G06F9/5016

    Abstract: A computer-implemented method includes identifying static information associated with a computing device that is running a media playback application. The method also includes monitoring the media playback application during a playback session to identify dynamic information associated with the playback session. Still further, the method includes instantiating a trained machine learning (ML) model to determine, based on historical usage data associated with the media playback application, a likelihood that the media playback application will experience an out of memory kill. The trained ML model implements a graded window to indicate a scaled likelihood that an out of memory kill will occur within a specified timeframe. Then, according to the trained ML model's determination, the method generates a prediction that an out of memory kill will occur for the media playback application within the specified timeframe. Various other methods, systems, and computer-readable media are also disclosed.

    Watermark-based techniques for change-data-capture
    312.
    发明授权
    Watermark-based techniques for change-data-capture 有权

    公开(公告)号：US11860849B2

    公开(公告)日：2024-01-02

    申请号：US17745739

    申请日：2022-05-16

    Applicant: NETFLIX, INC.

    Inventor： Andreas Andreakis ,  Ioannis Papapanagiotou

    IPC: G06F16/00 ,  G06F16/23

    CPC classification number: G06F16/2358 ,  G06F16/2308 ,  G06F16/2365

    Abstract: Various embodiments set forth systems and techniques for concurrent log and dump processing. The techniques include selecting, from a datastore, a chunk comprising one or more rows of data; comparing the one or more rows of data in the chunk with a first set of log events in a change log associated with the datastore, wherein each log event included in the first set of log events occurs after a first log event in the change log and prior to a second log event in the change log; selecting, based on the comparison, one or more non-conflicting rows in the chunk; and transmitting, to an output, one or more log events associated with the one or more non-conflicting rows in the chunk prior to processing a second set of log events in the change log, wherein the second set of log events occur after the second log event.

    COOPERATIVE COMPRESSION IN DISTRIBUTED DATABASES
    314.
    发明公开
    COOPERATIVE COMPRESSION IN DISTRIBUTED DATABASES 审中-公开

    公开(公告)号：US20230344446A1

    公开(公告)日：2023-10-26

    申请号：US18304242

    申请日：2023-04-20

    Applicant: NETFLIX, INC.

    Inventor： Joseph LYNCH

    IPC: H03M7/30

    CPC classification number: H03M7/3088

    Abstract: In various embodiments a computer-implemented method for managing use of a shared compression dictionary in a distributed database environment. The method includes determining that a given version of the shared compression dictionary should be designated as a current primary version of the shared compression dictionary. The method also includes receiving, from a client device, first write data compressed with a previous primary version of the shared compression dictionary and in response to receiving the first write data, transmitting, to the client device, the current primary version of the shared compression dictionary and an instruction to compress new write data with the current primary version of the shared compression dictionary. Additionally, the method includes receiving, from the client device, a second write data compressed with the current primary version of the shared compression dictionary and storing the second write data in a database.

    TECHNIQUES FOR AUTOMATICALLY INFERRING INTENTS OF SEARCH QUERIES
    315.
    发明公开
    TECHNIQUES FOR AUTOMATICALLY INFERRING INTENTS OF SEARCH QUERIES 审中-公开

    公开(公告)号：US20230334055A1

    公开(公告)日：2023-10-19

    申请号：US18299674

    申请日：2023-04-12

    Applicant: NETFLIX, INC.

    Inventor： Sudeep DAS ,  Ivan Gennadievich PROVALOV ,  Weidong ZHANG ,  Yi ZHANG

    IPC: G06F16/2457 ,  G06F16/28

    CPC classification number: G06F16/24578 ,  G06F16/285

    Abstract: In various embodiments, an intent-based query processing application processes search queries. The intent-based query processing application computes lexical similarity scores between a search query and a set of entities. The intent-based query processing application computes entity relevance scores based on the lexical similarity scores and user engagement scores associated with both the search query and the set of entities. The intent-based query processing application computes a first category relevance score associated with both the search query and a first category based on the entity relevance scores. The intent-based query processing application determines an intent associated with the search query based on the first category relevance score. The intent-based query processing application generates a response to the search query based on the intent.

    Global approach to buffering media content
    316.
    发明授权
    Global approach to buffering media content 有权

    公开(公告)号：US11770565B2

    公开(公告)日：2023-09-26

    申请号：US17466950

    申请日：2021-09-03

    Applicant: NETFLIX, INC.

    Inventor： Mark Watson

    IPC: H04N21/234 ,  H04N21/231 ,  H04N21/2387 ,  H04N21/24

    CPC classification number: H04N21/23406 ,  H04N21/231 ,  H04N21/2387 ,  H04N21/24

    Abstract: In various embodiments, a graph streaming application computes a first distance along a first potential playback path between a first playback position and a first media content block. The graph streaming application then computes a first score for the first media content block based on the first distance and a first probability associated with the first potential playback path. Similarly, the graph streaming application computes a second score for a second media content block based on a second playback position, a second potential playback path, and a second probability associated with the second potential playback path. The graph streaming application compares the first score and the second score to determine that the first media content block should be buffered by a client device. The graph streaming application then causes the first media content block to be stored in a playback buffer for subsequent playback on the client device.

    Techniques for generating per-title encoding ladders
    318.
    发明授权
    Techniques for generating per-title encoding ladders 有权

    公开(公告)号：US11750821B2

    公开(公告)日：2023-09-05

    申请号：US17174121

    申请日：2021-02-11

    Applicant: NETFLIX, INC.

    Inventor： Anush Moorthy ,  Zhi Li ,  Liwei Guo ,  Aditya Mavlankar ,  Anne Aaron

    IPC: H04N19/146 ,  H04N19/154 ,  H04N19/184 ,  H04N19/30

    CPC classification number: H04N19/146 ,  H04N19/154 ,  H04N19/184 ,  H04N19/30

    Abstract: In various embodiments, an encoding ladder application generates encoding ladders for encoding media titles. In operation, the encoding ladder application generates a first convex hull representing encoding tradeoffs between quality and bitrate when encoding a media title at a first resolution; The encoding ladder application generates a second convex hull representing encoding tradeoffs between quality and bitrate when encoding the media title at a second resolution. Based on the first convex hull and the second convex hull, the encoding ladder application generates an overall convex hull. Subsequently, the encoding ladder application generates an encoding ladder for the media title based on at least the overall convex hull and a ladder requirement. Advantageously, the tradeoffs between quality and bitrate represented by the encoding ladder are customized for the media title. Consequently, encoding inefficiencies attributable to conventional fixed-bitrate ladders can be reduced.

    Techniques for encoding a media title via multiple encoders
    320.
    发明授权
    Techniques for encoding a media title via multiple encoders 有权

    公开(公告)号：US11722720B2

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

    申请号：US17581480

    申请日：2022-01-21

    Applicant: NETFLIX, INC.

    Inventor： Ioannis Katsavounidis

    IPC: H04N21/2662 ,  H04N21/2343 ,  H04N21/238

    CPC classification number: H04N21/2662 ,  H04N21/23805 ,  H04N21/234309 ,  H04N21/234363

    Abstract: In various embodiments, a subsequence-based encoding application generates subsequences based on a source sequence associated with a media title. The subsequence-based encoding application then encodes both a first subsequence and a second subsequence across each of multiple configured encoders and at least one rate control value to generate, respectively, a first set of encoded subsequences and a second set of encoded subsequences. Notably, each configured encoder is associated with a combination of an encoder and a configuration, and at least two configured encoders are different from one another. Subsequently, the subsequence-based encoding application generates encoded media sequences based on the first set of encoded subsequences and the second set of encoded subsequences. Finally, the application selects a first encoded media sequence from the encoded media sequences based on a first target value for a media metric to subsequently stream to a first endpoint device during playback of the media title.

Patent Agency Ranking