Patents by Inventor Howard Karloff
Howard Karloff 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).
-
Publication number: 20170245290Abstract: A method, computer-readable storage device, and apparatus for allocating a plurality of timeslots of each channel of a plurality of channels in a wireless network are disclosed. For example, the method determines a location and a velocity for each user endpoint device of a plurality of user endpoint devices, estimates a future data rate for each user endpoint device at the location, estimates future timeslot allocations of each channel of the plurality of channels in the wireless network in accordance with the future data rate that is predicted for each user endpoint device, and allocates each timeslot of the plurality of timeslots of each channel of the plurality of channels in the wireless network to a user endpoint device of the plurality of user endpoint devices in accordance with the future timeslot allocations that are estimated for each channel.Type: ApplicationFiled: May 8, 2017Publication date: August 24, 2017Inventors: Ashwin Sridharan, Vaneet Aggarwal, Rittwik Jana, Howard Karloff, Nemmara K. Shankaranarayanan, Vinay Anant Vaishampayan, Robert Margolies, Gil Zussman
-
Patent number: 9648612Abstract: A method, computer-readable storage device, and apparatus for allocating a plurality of timeslots of each channel of a plurality of channels in a wireless network are disclosed. For example, the method determines a location and a velocity for each user endpoint device of a plurality of user endpoint devices, estimates a future data rate for each user endpoint device at the location, estimates future timeslot allocations of each channel of the plurality of channels in the wireless network in accordance with the future data rate that is predicted for each user endpoint device, and allocates each timeslot of the plurality of timeslots of each channel of the plurality of channels in the wireless network to a user endpoint device of the plurality of user endpoint devices in accordance with the future timeslot allocations that are estimated for each channel.Type: GrantFiled: December 23, 2013Date of Patent: May 9, 2017Assignees: AT&T Intellectual Property I, L.P., The Trustees of Columbia University in the City of New YorkInventors: Ashwin Sridharan, Vaneet Aggarwal, Rittwik Jana, Howard Karloff, Nemmara K. Shankaranarayanan, Vinay Anant Vaishampayan, Robert Margolies, Gil Zussman
-
Publication number: 20160125454Abstract: Systems and methods for managing advertisement campaign are provided. The system includes one or more devices having a processor and a non-transitory storage medium accessible to the hardware processor. The system includes a memory storing a database including campaign data. The system also includes a server computer in communication with the database. The server computer is programmed to receive a budget to be spent on a plurality of websites. The server computer is programmed to estimate a parameter for a non-linear model based on the campaign data. The server computer is programmed to estimate an expected number of conversions for each of the plurality of websites using the non-linear model with the estimated parameter. The server computer is programmed to determine an allocation of impressions for the plurality of websites that maximizes an estimated total number of conversions.Type: ApplicationFiled: November 4, 2014Publication date: May 5, 2016Applicant: YAHOO! INC.Inventors: Howard Karloff, Yifan Hu, Jeremy Kanterman, Pengyuan WANG, Shahriyar Sufi
-
Patent number: 9177343Abstract: Given a set of data for which a conservation law is an appropriate characterization, “hold” and/or “fail” tableaux are provided for the underlying conservation law, thereby providing a conservation dependency whereby portions of the data for which the law approximately holds or fails can be discovered and summarized in a semantically meaningful way.Type: GrantFiled: November 23, 2010Date of Patent: November 3, 2015Assignee: AT&T INTELLECTUAL PROPERTY I, L.P.Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Barna Saha
-
Publication number: 20150181596Abstract: A method, computer-readable storage device, and apparatus for allocating a plurality of timeslots of each channel of a plurality of channels in a wireless network are disclosed. For example, the method determines a location and a velocity for each user endpoint device of a plurality of user endpoint devices, estimates a future data rate for each user endpoint device at the location, estimates future timeslot allocations of each channel of the plurality of channels in the wireless network in accordance with the future data rate that is predicted for each user endpoint device, and allocates each timeslot of the plurality of timeslots of each channel of the plurality of channels in the wireless network to a user endpoint device of the plurality of user endpoint devices in accordance with the future timeslot allocations that are estimated for each channel.Type: ApplicationFiled: December 23, 2013Publication date: June 25, 2015Applicants: The Trustees of Columbia University in the City of New York, AT&T Intellectual Property I, L.P.Inventors: ASHWIN SRIDHARAN, Vaneet Aggarwal, Rittwik Jana, Howard Karloff, Nemmara K. Shankaranarayanan, Vinay Anant Vaishampayan, Robert Margolies, Gil Zussman
-
Patent number: 8856071Abstract: Data tables in data warehouses are updated to minimize staleness and stretch of the data tables. New data is received from external sources and, in response, update requests are generated. Accumulated update requests may be batched. Data tables may be weighted to affect the order in which update requests are serviced.Type: GrantFiled: August 11, 2009Date of Patent: October 7, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Lukasz Golab, Mohammad Hossein Bateni, Mohammad Hajiaghayi, Howard Karloff
-
Publication number: 20140149336Abstract: Methods and apparatus for processing data using sequential dependencies are disclosed herein. An example method includes modifying a first number of values in a sequence of a data set to generate a modified sequence such that each difference between each successive pair of values is within a threshold. A satisfiability metric is determined for the modified sequence based on a relationship between a number of modifications to the values in the sequence and a size of the sequence.Type: ApplicationFiled: February 3, 2014Publication date: May 29, 2014Applicant: AT&T Intellectual Property I, L.P.Inventors: Lukasz Golab, Howard Karloff, Phillip Korn, Divesh Srivastava, Avashek Saha
-
Patent number: 8645309Abstract: The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X?G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency.Type: GrantFiled: November 30, 2009Date of Patent: February 4, 2014Assignee: AT&T Intellectual Property I. L.P.Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Avishek Saha
-
Patent number: 8639667Abstract: Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony.Type: GrantFiled: March 3, 2009Date of Patent: January 28, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Bei Yu
-
Publication number: 20120130935Abstract: Given a set of data for which a conservation law is an appropriate characterization, “hold” and/or “fail” tableaux are provided for the underlying conservation law, thereby providing a conservation dependency whereby portions of the data for which the law approximately holds or fails can be discovered and summarized in a semantically meaningful way.Type: ApplicationFiled: November 23, 2010Publication date: May 24, 2012Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Barna Saha
-
Patent number: 7958075Abstract: A geometric model is considered for the problem of minimizing access control lists (ACLs) in network routers. A colored rectilinear pattern is created within an initially white rectangular canvas, and the basic operation is to choose a subrectangle and paint it a single color, overwriting all previous colors in the rectangle. The method operates on rectangular rule lists (RRLs) and access control lists (ACLs) in which all rectangles are strips that extend either the full length or the full height of the canvas. A polynomial-time algorithm optimally constructs such patterns when, as in the ACL application, the only colors are black and white (permit or deny). That algorithm is complemented by a significantly faster approximation algorithm that is guaranteed to be no worse than 3/2 optimal.Type: GrantFiled: June 28, 2007Date of Patent: June 7, 2011Assignee: AT&T Intellectual Property II, LPInventors: David L. Applegate, Gruia Calinescu, David S. Johnson, Howard Karloff, Katrina Ligett, Jia Wang
-
Publication number: 20110131170Abstract: The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X?G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency.Type: ApplicationFiled: November 30, 2009Publication date: June 2, 2011Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Avishek Saha
-
Publication number: 20110040727Abstract: Data tables in data warehouses are updated to minimize staleness and stretch of the data tables. New data is received from external sources and, in response, update requests are generated. Accumulated update requests may be batched. Data tables may be weighted to affect the order in which update requests are serviced.Type: ApplicationFiled: August 11, 2009Publication date: February 17, 2011Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.Inventors: Lukasz Golab, Mohammad Hossein Bateni, Mohammad Hajiaghayi, Howard Karloff
-
Patent number: 7706286Abstract: Given a set of network nodes B that are sought to be monitored, and a set of potential monitoring nodes, a subset M of the monitoring nodes is chosen that insures monitoring each node b in B with a pair of nodes mi and mj such that no node except b is on both any shortest path from b to mi and on any shortest path from b to mj. Some of the nodes in M are chosen in a first step by identifying a subset of B having nodes b that are “t-good” nodes, choosing a subset of potential monitoring nodes as First Partner nodes, and choosing a corresponding subset of potential monitoring nodes as Second Partner nodes. Others are chosen in a second step that handles nodes b that are not “t-good,” using a greedy algorithm.Type: GrantFiled: July 8, 2008Date of Patent: April 27, 2010Inventor: Howard Karloff
-
Publication number: 20100008368Abstract: Given a set of network nodes B that are sought to be monitored, and a set of potential monitoring nodes, a subset M of the monitoring nodes is chosen that insures monitoring each node b in B with a pair of nodes mi and mj such that no node except b is on both any shortest path from b to mi and on any shortest path from b to mj. Some of the nodes in Mare chosen in a first step by identifying a subset of B having nodes b that are “t-good” nodes, choosing a subset of potential monitoring nodes as First Partner nodes, and choosing a corresponding subset of potential monitoring nodes as Second Partner nodes. Others are chosen in a second step that handles nodes b that are not “t-good,” using a greedy algorithm.Type: ApplicationFiled: July 8, 2008Publication date: January 14, 2010Inventor: Howard Karloff
-
Publication number: 20090287721Abstract: Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony.Type: ApplicationFiled: March 3, 2009Publication date: November 19, 2009Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Bei Yu