-
公开(公告)号：US20240146671A1
公开(公告)日：2024-05-02
申请号：US18409267
申请日：2024-01-10
申请人： GOOGLE LLC
发明人： Andrew Tomkins , Shanmugasundaram Ravikumar , Shalini Agarwal , Mylinh Yang , Bo Pang , Mark Yinan Li
IPC分类号： H04L51/04 , G06F16/28 , H04L51/00 , H04L51/02 , H04L51/216 , H04L51/52 , H04L67/306
CPC分类号： H04L51/04 , G06F16/288 , H04L51/00 , H04L51/02 , H04L51/216 , H04L51/52 , H04L67/306 , H04L51/48
摘要： Methods and apparatus related to identifying one or more messages sent by a user-identifying two or more contacts that are associated with one or more of the messages, determining a strength of relationship score between identified contacts, and utilizing the strength of relationship scores to provide additional information related to the contacts. A strength of relationship score between a contact and one or more other contacts may be determined based on one or more properties of one or more of the messages. In some implementations, contacts groups maybe determined based on the strength of relationship scores. In some implementations, contacts groups may be utilized to disambiguate references to contacts in messages. In some implementations, contacts group may be utilized to provide suggestions to the user of additional contacts of a contacts group that includes the indicated recipient contact of a message.
-
公开(公告)号：US10963301B2
公开(公告)日：2021-03-30
申请号：US16932581
申请日：2020-07-17
申请人： Google LLC
发明人： Erik Nathan Vee , Manish Deepak Purohit , Joshua Ruizhi Wang , Shanmugasundaram Ravikumar , Zoya Svitkina
IPC分类号： G06F9/48 , G06F16/901 , G06N3/02
摘要： Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.
-
公开(公告)号：US20240126596A1
公开(公告)日：2024-04-18
申请号：US18223495
申请日：2023-07-18
申请人： Google LLC
发明人： Erik Nathan Vee , Manish Deepak Purohit , Joshua Ruizhi Wang , Shanmugasundaram Ravikumar , Zoya Svitkina
IPC分类号： G06F9/48 , G06F16/901 , G06N3/02
CPC分类号： G06F9/4881 , G06F16/9024 , G06N3/02
摘要： Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.
-
公开(公告)号：US11876760B2
公开(公告)日：2024-01-16
申请号：US17882238
申请日：2022-08-05
申请人： GOOGLE LLC
发明人： Andrew Tomkins , Shanmugasundaram Ravikumar , Shalini Agarwal , MyLinh Yang , Bo Pang , Mark Yinan Li
IPC分类号： H04L51/04 , H04L51/00 , H04L51/02 , H04L51/52 , H04L51/216 , G06F16/28 , H04L67/306 , H04L51/48
CPC分类号： H04L51/04 , G06F16/288 , H04L51/00 , H04L51/02 , H04L51/216 , H04L51/52 , H04L67/306 , H04L51/48
摘要： Methods and apparatus related to identifying one or more messages sent by a user, identifying two or more contacts that are associated with one or more of the messages, determining a strength of relationship score between identified contacts, and utilizing the strength of relationship scores to provide additional information related to the contacts. A strength of relationship score between a contact and one or more other contacts may be determined based on one or more properties of one or more of the messages. In some implementations, contacts groups may be determined based on the strength of relationship scores. In some implementations, contacts groups may be utilized to disambiguate references to contacts in messages. In some implementations, contacts group may be utilized to provide suggestions to the user of additional contacts of a contacts group that includes the indicated recipient contact of a message.
-
公开(公告)号：US11755367B2
公开(公告)日：2023-09-12
申请号：US17214699
申请日：2021-03-26
申请人： Google LLC
发明人： Erik Nathan Vee , Manish Deepak Purohit , Joshua Ruizhi Wang , Shanmugasundaram Ravikumar , Zoya Svitkina
IPC分类号： G06F9/48 , G06F16/901 , G06N3/02
CPC分类号： G06F9/4881 , G06F16/9024 , G06N3/02
摘要： Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.
-
公开(公告)号：US20230032705A1
公开(公告)日：2023-02-02
申请号：US17863186
申请日：2022-07-12
申请人： Google LLC
发明人： Vidhya Navalpakkam , Pasin Manurangsi , Nachiappan Valliappan , Kai Kohlhoff , Junfeng He , Badih Ghazi , Shanmugasundaram Ravikumar
IPC分类号： G06F21/62
摘要： Improved methods are provided for generating heatmaps or other summary map data from multiple users' data (e.g., probability distributions) in a manner that preserves the privacy of the users' data while also generating heatmaps that are visually similar to the ‘true’ heatmap. These methods include decomposing the average of the users' data (the ‘true’ heatmap) into multiple different spatial scales, injecting random noise into the data at the multiple different spatial scales, and then reconstructing the privacy-preserving heatmap based on the noisy multi-scale representations. The magnitude of the noise injected at each spatial scale is selected to ensure preservation of privacy while also resulting in heatmaps that are visually similar to the ‘true’ heatmap.
-
公开(公告)号：US20210243171A1
公开(公告)日：2021-08-05
申请号：US17122638
申请日：2020-12-15
申请人： Google LLC
发明人： Badih Ghazi , Noah Zeger Golowich , Shanmugasundaram Ravikumar , Pasin Manurangsi , Ameya Avinash Velingker , Rasmus Pagh
摘要： An encoding method for enabling privacy-preserving aggregation of private data can include obtaining private data including a private value, determining a probabilistic status defining one of a first condition and a second condition, producing a multiset including a plurality of multiset values, and providing the multiset for aggregation with a plurality of additional multisets respectively generated for a plurality of additional private values. In response to the probabilistic status having the first condition, the plurality of multiset values is based at least in part on the private value, and in response to the probabilistic status having the second condition, the plurality of multiset values is a noise message. The noise message is produced based at least in part on a noise distribution that comprises a discretization of a continuous unimodal distribution supported on a range from zero to a number of multiset values included in the plurality of multiset values.
-
公开(公告)号：US10680991B1
公开(公告)日：2020-06-09
申请号：US16271236
申请日：2019-02-08
申请人： Google LLC
发明人： Andrew Tomkins , Shanmugasundaram Ravikumar , Shalini Agarwal , MyLinh Yang , Bo Pang , Mark Yinan Li
摘要： Methods and apparatus related to determining an effect on dissemination of information related to an event based on a dynamic confidence level associated with the event. For example, an event and an event confidence level of the event may be determined based on a message of a user. An effect on dissemination of information related to the event may be determined based on the confidence level. A new confidence level may be determined based on additional data associated with the event and the effect on dissemination of information may be adjusted based on the new confidence level. In some implementations, the additional data may be based on a new message that is related to the message, such as a reply to the message.
-
公开(公告)号：US12072987B1
公开(公告)日：2024-08-27
申请号：US17227532
申请日：2021-04-12
申请人： Google LLC
摘要： The present disclosure provides practical communication-efficient and low-error algorithms for aggregation of private data. For example, the proposed algorithms can be implemented in the shuffled DP model. Specific example operations that can be performed using the proposed algorithms include summation (e.g., binary summation, integer summation) and histograms over a moderate number of buckets. The proposed algorithms achieve accuracy that is arbitrarily close to that of central DP algorithms with an expected communication per user essentially matching what is needed without any privacy constraints.
-
公开(公告)号：US11928159B2
公开(公告)日：2024-03-12
申请号：US17204546
申请日：2021-03-17
申请人： Google LLC
IPC分类号： G06F16/906 , G06F18/21 , G06F18/214 , G06F18/23213 , G06F18/2413
CPC分类号： G06F16/906 , G06F18/214 , G06F18/2193 , G06F18/23213 , G06F18/24137
摘要： Example techniques are provided for the task of differentially private clustering. For several basic clustering problems, including Euclidean DensestBall, 1-Cluster, k-means, and k-median, the present disclosure provides efficient differentially private algorithms that achieve essentially the same approximation ratios as those that can be obtained by any non-private algorithm, while incurring only small additive errors. This improves upon existing efficient algorithms that only achieve some large constant approximation factors.
-
-
-
-
-
-
-
-
-
搜索结果
23 条记录 (耗时 0.018 秒)
