Patents by Inventor Eyal Lubetzky
Eyal Lubetzky 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: 9575809Abstract: A “Stochastic Clustering-Based Network Generator” enables rapid formation of an interconnected hierarchical network structure from an arbitrary number of agents via an iterative turn-based coalescence process. Given N agents wishing to coalesce into one hierarchical network, a turn-based process allows each agent (or the head of each hierarchical cluster of agents), to randomly decide whether to issue or listen for merge requests in each round. Issuing a request amounts to contacting a randomly chosen agent with a merge request. Given multiple received requests, a cluster head will randomly accept one request for a merge received by any agent in that cluster. The requesting cluster then merges as a hierarchical child of the accepting cluster. In a related embodiment, given multiple merge requests, the request from the smallest cluster is accepted. In further embodiments, ties of the smallest cluster size are broken based on various options.Type: GrantFiled: January 10, 2012Date of Patent: February 21, 2017Assignee: Microsoft Technology Licensing, LLCInventors: Eyal Lubetzky, Yuval Peres, Dahlia Malkhi, Po-Shen Loh
-
Patent number: 9213780Abstract: Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.Type: GrantFiled: June 26, 2009Date of Patent: December 15, 2015Assignee: Microsoft Technology Licensing LLCInventors: Joseph Yossi Azar, Eric Horvitz, Eyal Lubetzky, Dafna Shahaf
-
Publication number: 20130179487Abstract: A “Stochastic Clustering-Based Network Generator” enables rapid formation of an interconnected hierarchical network structure from an arbitrary number of agents via an iterative turn-based coalescence process. Given N agents wishing to coalesce into one hierarchical network, a turn-based process allows each agent (or the head of each hierarchical cluster of agents), to randomly decide whether to issue or listen for merge requests in each round. Issuing a request amounts to contacting a randomly chosen agent with a merge request. Given multiple received requests, a cluster head will randomly accept one request for a merge received by any agent in that cluster. The requesting cluster then merges as a hierarchical child of the accepting cluster. In a related embodiment, given multiple merge requests, the request from the smallest cluster is accepted. In further embodiments, ties of the smallest cluster size are broken based on various options.Type: ApplicationFiled: January 10, 2012Publication date: July 11, 2013Applicant: MICROSOFT CORPORATIONInventors: Eyal Lubetzky, Yuval Peres, Dahlia Malkhi, Po-Shen Loh
-
Patent number: 8406694Abstract: A computing device configured to select a channel that is open in a local environment of the computing device and to attempt to communicate with another computing device on the selected available channel is described herein. The computing device selects the available channel based on selection probabilities for a plurality of available channels, the selection probabilities defined by an exponentially decaying distribution curve.Type: GrantFiled: June 11, 2010Date of Patent: March 26, 2013Assignee: Microsoft CorporationInventors: Eyal Lubetzky, Ori Gurel-Gurevich, Thomas Moscibroda, Joseph Yossi Azar
-
Publication number: 20110306301Abstract: A computing device configured to select a channel that is open in a local environment of the computing device and to attempt to communicate with another computing device on the selected available channel is described herein. The computing device selects the available channel based on selection probabilities for a plurality of available channels, the selection probabilities defined by an exponentially decaying distribution curve.Type: ApplicationFiled: June 11, 2010Publication date: December 15, 2011Applicant: Microsoft CorporationInventors: Eyal Lubetzky, Ori Gurel-Gurevich, Thomas Moscibroda, Joseph Yossi Azar
-
Publication number: 20100332513Abstract: Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.Type: ApplicationFiled: June 26, 2009Publication date: December 30, 2010Applicant: Microsoft CorporationInventors: Joseph Yossi Azar, Eric Horvitz, Eyal Lubetzky, Dafna Shahaf
-
Publication number: 20090170584Abstract: A tournament-style gaming scenario exploration system and method for interactively exploring current and future scenarios of a tournament and associated pick'em pool. The system and method include a prediction module (including a game constraint sub-module), and a key event detection module. Embodiments of the prediction module include a binary integer that represents tournament outcomes. The prediction module generates predictions of tournament outcomes using an exhaustive or a sampling technique. The sampling technique includes random sampling, where the tournament bracket is randomly sampled, and a weighted sampling technique, which sample portions of the tournament bracket more densely than others areas. Embodiments of the game constraint sub-module allow real-world results constraints and user-supplied constraints to be imposed on the tournament outcomes.Type: ApplicationFiled: December 28, 2007Publication date: July 2, 2009Applicant: Microsoft CorporationInventors: Desney S. Tan, Gregory R. Smith, Yuval Peres, Joseph Yossi Azar, Eyal Lubetzky
-
Patent number: 7327761Abstract: A method of streaming data, comprising: receiving an input stream of data, at a transmitter; dividing the input stream into a plurality of blocks, at least one of which blocks is incomplete; generating a plurality of first packets based on at least one block of data; generating at least one second packet from at least one as yet incomplete block of data; said block comprising recently received data; transmitting said at least one first packet and at least one second packet to a receiver that can reconstruct said stream from said first packets and said second packets, said transmitting utilizing a differential protocol by which different parts of the data are transmitted at different rates, so that a receiver can join the transmission at any time and start receiving the data at a minimum delay; and generating at least one third packet from said at least one incomplete block; said at least one third packet being based at least in part on data received subsequent to data forming the basis for the at least one seType: GrantFiled: August 1, 2001Date of Patent: February 5, 2008Assignee: Bandwiz Inc.Inventors: Doron Rajwan, Eyal Lubetzky, Joseph Yossi Azar
-
Publication number: 20040034712Abstract: A method of streaming data, comprising: receiving an input stream of data, at a transmitter; dividing the input stream into a plurality of blocks, at least one of which blocks is incomplete; generating a plurality of first packets based on at least one block of data; generating at least one second packet from at least one as yet incomplete block of data; said block comprising recently received data; transmitting said at least one first packet and at least one second packet to a receiver that can reconstruct said stream from said first packets and said second packets, said transmitting utilizing a differential protocol by which different parts of the data are transmitted at different rates, so that a receiver can join the transmission at any time and start receiving the data at a minimum delay; and generating at least one third packet from said at least one incomplete block; said at least one third packet being based at least in part on data received subsequent to data forming the basis for the at least one seType: ApplicationFiled: July 17, 2003Publication date: February 19, 2004Inventors: Doron Rajwan, Eyal Lubetzky, Joseph Yossi Azar
-
Publication number: 20030007507Abstract: A method of transmitting a data file over a communication medium (100), comprising determining relative desired reconstruction time frames for different parts of the file, allocating different transmission rates for the different parts of the file responsive to said determining, dividing the file into sections, encoding the sections using a FEC (forward error correction) code having the property that a file section can be reconstructed once a sufficient amount of encoded data relating to that data section is received (104), and transmitting the encoded sections to have effective retransmission rates matching said different retransmission rates (102), such that the parts can be reconstructed in their respective desired time frame.Type: ApplicationFiled: October 4, 2001Publication date: January 9, 2003Inventors: Doron Rajwan, Eyal Lubetzky