Patents by Inventor Edith Cohen

Edith Cohen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10115115
    Abstract: One or more all-distances sketches are generated for nodes in a graph. An all-distances sketch for a node includes a subset of the nodes of the graph, and a shortest distance between the node and each of the nodes in the subset of nodes. The generated all-distances sketches are used to estimate the closeness similarity of nodes. The estimated closeness similarity can be used for targeted advertising or for content item recommendation, for example.
    Type: Grant
    Filed: September 16, 2014
    Date of Patent: October 30, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Renato F. Werneck, Moises Goldszmidt, Andrew V. Goldberg, Edith Cohen, Daniel Delling, Fabian Fuchs
  • Patent number: 9779142
    Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.
    Type: Grant
    Filed: April 30, 2014
    Date of Patent: October 3, 2017
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Edith Cohen, Haim Kaplan
  • Patent number: 9690827
    Abstract: Historic inverse probability estimators are created for a graph based on all-distance sketches associated with each node of the graph. The historic inverse probability estimators include adjusted weights for each node. Graph operations such as closeness centrality are estimated using the historic inverse probability estimators. The historic inverse probability estimators can also be applied to element streams and can be used to estimate a number of unique elements in received in the element stream.
    Type: Grant
    Filed: April 15, 2014
    Date of Patent: June 27, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventor: Edith Cohen
  • Publication number: 20160350382
    Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.
    Type: Application
    Filed: August 15, 2016
    Publication date: December 1, 2016
    Inventors: Renato F. Werneck, Daniel Delling, Thomas Pajor, Edith Cohen
  • Patent number: 9443034
    Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.
    Type: Grant
    Filed: May 29, 2014
    Date of Patent: September 13, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Renato F. Werneck, Daniel Delling, Thomas Pajor, Edith Cohen
  • Publication number: 20160078148
    Abstract: One or more all-distances sketches are generated for nodes in a graph. An all-distances sketch for a node includes a subset of the nodes of the graph, and a shortest distance between the node and each of the nodes in the subset of nodes. The generated all-distances sketches are used to estimate the closeness similarity of nodes. The estimated closeness similarity can be used for targeted advertising or for content item recommendation, for example.
    Type: Application
    Filed: September 16, 2014
    Publication date: March 17, 2016
    Inventors: Renato F. Werneck, Moises Goldszmidt, Andrew V. Goldberg, Edith Cohen, Daniel Delling, Fabian Fuchs
  • Publication number: 20150347625
    Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.
    Type: Application
    Filed: May 29, 2014
    Publication date: December 3, 2015
    Applicant: Microsoft Corporation
    Inventors: Renato F. Werneck, Daniel Delling, Thomas Pajor, Edith Cohen
  • Publication number: 20150293922
    Abstract: Historic inverse probability estimators are created for a graph based on all-distance sketches associated with each node of the graph. The historic inverse probability estimators include adjusted weights for each node. Graph operations such as closeness centrality are estimated using the historic inverse probability estimators. The historic inverse probability estimators can also be applied to element streams and can be used to estimate a number of unique elements in received in the element stream.
    Type: Application
    Filed: April 15, 2014
    Publication date: October 15, 2015
    Applicant: Microsoft Corporation
    Inventor: Edith Cohen
  • Patent number: 9116958
    Abstract: Methods, apparatus, and articles of manufacture are disclosed to sample signed weighted updates. Example methods disclosed herein include identifying a first key associated with a data update obtained by sampling a stream of data received from a plurality of nodes in a network, the first key being representative of a first node in the plurality of nodes, adjusting a first value associated with the first key based on a weight associated with the data update, the weight being positive when the data update corresponds to opening of a new data connection with the first node, the weight being negative when the data update corresponds to closing of an existing data connection with the first node, and estimating a status of the first node based on the first value.
    Type: Grant
    Filed: December 7, 2012
    Date of Patent: August 25, 2015
    Assignee: AT&T INTELLECTUAL PROPERTY I, L.P.
    Inventors: Graham Cormode, Edith Cohen, Nicholas Geoffrey Duffield
  • Publication number: 20140236966
    Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.
    Type: Application
    Filed: April 30, 2014
    Publication date: August 21, 2014
    Inventors: Edith Cohen, Haim Kaplan
  • Publication number: 20140164392
    Abstract: Methods, apparatus, and articles of manufacture are disclosed to sample signed weighted updates. Example methods disclosed herein include identifying a first key associated with a data update obtained by sampling a stream of data received from a plurality of nodes in a network, the first key being representative of a first node in the plurality of nodes, adjusting a first value associated with the first key based on a weight associated with the data update, the weight being positive when the data update corresponds to opening of a new data connection with the first node, the weight being negative when the data update corresponds to closing of an existing data connection with the first node, and estimating a status of the first node based on the first value.
    Type: Application
    Filed: December 7, 2012
    Publication date: June 12, 2014
    Applicant: AT&T Intellectual Property I, L.P.
    Inventors: Graham Cormode, Edith Cohen, Nicholas Geoffrey Duffield
  • Patent number: 8738618
    Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.
    Type: Grant
    Filed: December 12, 2008
    Date of Patent: May 27, 2014
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Edith Cohen, Haim Kaplan
  • Patent number: 8706737
    Abstract: A method and apparatus for processing top-k queries are disclosed. For example, the method receives a top-k query with a value for a number of samples and a value of a confidence parameter. The method samples in accordance to the number of samples, and determines a top-k weight of a sample top-k set. The method bounds the top-k weight in an interval having an upper bound and a lower bound such that the top-k weight is in the interval with a probability equal to one minus the value of the confidence parameter, and provides a response to the top-k query in accordance with the upper and lower bounds.
    Type: Grant
    Filed: December 31, 2008
    Date of Patent: April 22, 2014
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Edith Cohen, Nadav Grossaug, Haim Kaplan
  • Patent number: 8650266
    Abstract: In accordance with aspects of the invention, “low-level” caches can utilize source selection while non-authoritative sources can take advantage of rejuvenation to alleviate what the inventor refers to as “age penalty” and thereby reduce validation traffic.
    Type: Grant
    Filed: April 12, 2002
    Date of Patent: February 11, 2014
    Assignee: AT&T Intellectual Property II, L.P.
    Inventor: Edith Cohen
  • Patent number: 8195710
    Abstract: A method for producing a summary A of data points in an unaggregated data stream wherein the data points are in the form of weighted keys (a, w) where a is a key and w is a weight, and the summary is a sample of k keys a with adjusted weights wa. A first reservoir L includes keys having adjusted weights which are additions of weights of individual data points of included keys and a second reservoir T includes keys having adjusted weights which are each equal to a threshold value ? whose value is adjusted based upon tests of new data points arriving in the data stream. The summary combines the keys and adjusted weights of the first reservoir L with the keys and adjusted weights of the second reservoir T to form the sample representing the data stream upon which further analysis may be performed.
    Type: Grant
    Filed: December 18, 2009
    Date of Patent: June 5, 2012
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Edith Cohen, Nicholas Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
  • Patent number: 8166047
    Abstract: Certain exemplary embodiments can provide a method, which can comprise automatically storing and computing a sketch of a dataset that supports an automatically determined estimator of properties of a dataset. The dataset can be related to any population. For example, the dataset can comprise data flows through a network node (e.g., a router), sales data, and/or marketing data, etc. The estimator can be based upon a sketch of the dataset.
    Type: Grant
    Filed: August 6, 2008
    Date of Patent: April 24, 2012
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Edith Cohen, Haim Kaplan
  • Patent number: 8140539
    Abstract: Certain exemplary embodiments can provide a method, which can comprise automatically storing a sketch of a dataset that supports automatic determination of an estimator of properties of a dataset. The automatic determination can be based upon computed adjusted weights to the items included in a sketch of the dataset. The adjusted weights can be used to compute estimates on the weight of any subpopulation of the items in the dataset that is specified using a selection predicate. We propose the rank conditioning, the subset conditioning, and/or a Markov-chain based method to compute these adjusted weights. We also provide a method that provides upper and lower confidence bounds on the size of a subpopulation.
    Type: Grant
    Filed: August 6, 2008
    Date of Patent: March 20, 2012
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Edith Cohen, Haim Kaplan
  • Patent number: 8069150
    Abstract: A request is received at a resource server for a first resource, the request accompanied by a proxy filter. A second resource is identified based on the proxy filter and based on a relationship between the first resource and the second resource. The first resource and information regarding the second resource is provided to a network interface for communication to a proxy server.
    Type: Grant
    Filed: November 24, 2009
    Date of Patent: November 29, 2011
    Assignee: AT&T Intellectual Property II, LP
    Inventors: Edith Cohen, Balachander Krishnamurthy, Jennifer Lynn Rexford
  • Patent number: 8031635
    Abstract: A method and apparatus for provide highly efficient traffic routing for a wide range of possible traffic matrices (TM) in an intra-domain network. That routing optimally balances the traffic loads over a range of traffic matrices so as to minimize the deviation for any particular traffic matrix from the optimal routing. Such a routing provides a guaranteed performance ratio against the best possible network routing. The invention utilizes a method of optimally configuring a traffic network based on solving a linear program to obtain the optimal routing, and then configuring the routing on the network accordingly.
    Type: Grant
    Filed: June 3, 2008
    Date of Patent: October 4, 2011
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: David Lee Applegate, Edith Cohen
  • Patent number: 8005949
    Abstract: The present invention relates to a method of obtaining a generic sample of an input stream. The method is designated as VAROPTk. The method comprises receiving an input stream of items arriving one at a time, and maintaining a sample S of items i. The sample S has a capacity for at most k items i. The sample S is filled with k items i. An nth item i is received. It is determined whether the nth item i should be included in sample S. If the nth item i is included in sample S, then a previously included item i is dropped from sample S. The determination is made based on weights of items without distinguishing between previously included items i and the nth item i. The determination is implemented thereby updating weights of items i in sample S. The method is repeated until no more items are received.
    Type: Grant
    Filed: December 1, 2008
    Date of Patent: August 23, 2011
    Assignee: AT&T Intellectual Property I, LP
    Inventors: Nicholas Duffield, Carsten Lund, Mikkel Thorup, Edith Cohen, Haim Kaplan