Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Highly probable identification of related messages using sparse hash function sets

Highly probable identification of related messages using sparse hash function sets

US Patent 12160353 · Granted Dec 3, 2024

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Allocating virtual machines in a gateway coupled to a software-defined switch2022
Time determination of distributed events without distribution of reference time,2022
Time determination of distributed events without distribution of reference time,2022
Highly probable identification of related messages using sparse hash function se2021
Highly probable identification of related messages using sparse hash function se2021
System and method for real time digitization of hand written input data2021
Controlling of virtualized network functions for usage in communication network2021
Quality of service (QoS) support for tactile traffic2020
Time determination of distributed events without distribution of reference time,2020
Time determination of distributed events without distribution of reference time,2020
Metadata correlation and disambiguation2019
Metadata correlation and disambiguation2019