Patents by Inventor Adam Kaplan
Adam Kaplan 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: 20250115240Abstract: Lidar produces three-dimensional point clouds. From the point clouds, objects need to be detected and tracked. For example, from the point clouds, embodiments detect what kind of objects is detected, what shape the object is, and the objects current location and trajectory. Each lidar sensor on a vehicle produces a point cloud periodically. The point cloud is input into a deep learning neural network that outputs road geometry, such as road edges and lane dividers. In some embodiments, the other network can also output information about other objects in the environment, such as other vehicles and pedestrians.Type: ApplicationFiled: October 8, 2024Publication date: April 10, 2025Applicant: MOBILEYE VISION TECHNOLOGIES LTD.Inventors: Jeffrey MOSKOWITZ, Boris BRAGINSKY, David BOUBLIL, Shmuel HAZUT, Alon ZIV, Yahel GUBERMAN, Avner YAKOV, Niv KEREN, Aryeh NAILAND, Adam KAPLAN, Rotem IDELSON, Izhak Daniel YACOBY
-
Publication number: 20240273286Abstract: Embodiments of the disclosed technologies include generating, by a generative language model, a first version of a first document, generating a second version of the first document by dividing the first version of the first document into a plurality of segments, where a first segment of the plurality of segments includes a subset of the digital content generated by the generative language model; enabling contributions to the first segment; enabling contributions to a second segment of the plurality of segments; receiving a first contribution to the second version of the first document, where the first contribution includes digital content generated by a first user of the network; creating a first segment-contribution pair by linking the first contribution with the first segment; receiving a second contribution to the second version of the first document; and creating a second segment-contribution pair by linking the second contribution with the second segment, where at least one of the first segment-contributType: ApplicationFiled: February 15, 2023Publication date: August 15, 2024Inventors: Maria Iu, Lakshman Somasundaram, Yilin Li, Shweta Patira, Adam Kaplan, Sara Remi Fields
-
Publication number: 20240273291Abstract: Embodiments of the disclosed technologies include, in response to input of a first prompt to a generative language model, outputting, by the generative language model, a first document including a first piece of writing, where the first piece of writing is based on the first prompt. Feedback is received for the first document, where the feedback includes a rating for the first piece of writing. Using the generative language model, a second prompt different from the first prompt is generated, where the second prompt is based on the feedback. In response to input of the second prompt to the generative language model, the generative language model outputs a second document different from the first document, where the second document includes a second piece of writing based on the second prompt. The second document is published to a network.Type: ApplicationFiled: February 15, 2023Publication date: August 15, 2024Inventors: Alana M. Smith, Lakshman Somasundaram, Saarth Shah, Laura Lorenzetti Soper, Adam Kaplan, Manas Somaiya, Yao Pan
-
Patent number: 11412198Abstract: A mechanism is described for facilitating monochrome bit depth coding. The apparatus comprises one or more processors to receive depth data and convert the depth data into color space data, including converting a first segment of the depth data into a monochrome component of the color space data and converting a second segment of the depth data into one or more color components of the color space data.Type: GrantFiled: April 29, 2019Date of Patent: August 9, 2022Assignee: Intel CorporationInventors: Jill Boyce, Tzachi Hershkovich, Eyal Ruhm, Tzach Ashkenazi, Eli Turiel, Adam Kaplan
-
Patent number: 11250616Abstract: Methods, systems and apparatuses may provide for technology that generates a point cloud model of an object depicted in image content associated with a plurality of physical cameras, generates a color projection of the point cloud model based on viewpoint information associated with a virtual camera, and excludes background color information from the color projection based on one or more segmentation masks associated with the object. The technology may also exclude peripheral information from the color projection based on at least one of the segmentation mask(s) and the viewpoint information.Type: GrantFiled: March 27, 2020Date of Patent: February 15, 2022Assignee: Intel CorporationInventors: Adam Kaplan, Yuval Hovers, Ilan Beer, Ben Raziel
-
Publication number: 20210304490Abstract: Methods, systems and apparatuses may provide for technology that generates a point cloud model of an object depicted in image content associated with a plurality of physical cameras, generates a color projection of the point cloud model based on viewpoint information associated with a virtual camera, and excludes background color information from the color projection based on one or more segmentation masks associated with the object. The technology may also exclude peripheral information from the color projection based on at least one of the segmentation mask(s) and the viewpoint information.Type: ApplicationFiled: March 27, 2020Publication date: September 30, 2021Inventors: Adam Kaplan, Yuval Hovers, Ilan Beer, Ben Raziel
-
Patent number: 10628990Abstract: A system and method for rendering stereoscopic panoramas. For example in one embodiment, vertices of geometric primitives are generated for a panoramic image. Vertices of geometric primitives are stored in a 3-D coordinate system. A vertex processor determines a final location, equivalent to latitude and longitude coordinates, for each of the vertices in a panoramic image. A rendering engine renders the panoramic image in accordance with the final location of each of the vertices.Type: GrantFiled: August 29, 2018Date of Patent: April 21, 2020Assignee: Intel CorporationInventor: Adam Kaplan
-
Publication number: 20200074716Abstract: A system and method for rendering stereoscopic panoramas. For example in one embodiment, vertices of geometric primitives are generated for a panoramic image. Vertices of geometric primitives are stored in a 3-D coordinate system. A vertex processor determines a final location, equivalent to latitude and longitude coordinates, for each of the vertices in a panoramic image. A rendering engine renders the panoramic image in accordance with the final location of each of the vertices.Type: ApplicationFiled: August 29, 2018Publication date: March 5, 2020Inventor: ADAM KAPLAN
-
Publication number: 20190373241Abstract: A mechanism is described for facilitating monochrome bit depth coding. The apparatus comprises one or more processors to receive depth data and convert the depth data into color space data, including converting a first segment of the depth data into a monochrome component of the color space data and converting a second segment of the depth data into one or more color components of the color space data.Type: ApplicationFiled: April 29, 2019Publication date: December 5, 2019Applicant: Intel CorporationInventors: Jill Boyce, Tzachi Hershkovich, Eyal Ruhm, Tzach Ashkenazi, Eli Turiel, Adam Kaplan
-
Patent number: 8548965Abstract: There is provided, in a computer processing system, an apparatus for managing object data. The apparatus includes a changed objects manager for creating and managing a changed objects list that at least identifies the objects that have changed based on time of change. The changed objects list is associated with a plurality of time buckets. Each of the plurality of time buckets is associated with a respective date and time period and with object change records for objects having a timestamp falling within the respective date and time period. Each of the object change records is associated with a unique object identifier and the timestamp for a corresponding one of the objects. The timestamp specifies a date and a time corresponding to a latest one of a creation time or a most recent update time for the corresponding one of the objects.Type: GrantFiled: April 2, 2008Date of Patent: October 1, 2013Assignee: International Business Machines CorporationInventors: Murthy V. Devarakonda, Frank Stewart Filz, Marc Adam Kaplan, James John Seeger, Jr., Jason C. Young
-
Patent number: 8315993Abstract: There is provided, in a computer processing system, an apparatus for storage lifecycle management for a plurality of managed objects. The apparatus includes a policy decision manager for creating and managing a policy decision stash. The policy decision stash is associated with predictive policy decisions for the plurality of managed objects and is configured to allow the predictive policy decisions for the plurality of managed objects to be incrementally updated and accessed in the policy decision stash by a policy identifier and an effective timestamp.Type: GrantFiled: May 13, 2005Date of Patent: November 20, 2012Assignee: International Business Machines CorporationInventor: Marc Adam Kaplan
-
Patent number: 8270316Abstract: An on-chip Radio Frequency (RF) Interconnect (RF-I) for communication between internal circuit nodes of an integrated circuit is provided. In one embodiment, an integrated circuit is provided that includes an on-chip transmission line, a first circuit node associated with an RF transmitter connected to the transmission line, and a second circuit node associated with an RF receiver connected to the transmission line. In order to transmit data from the first circuit node to the second circuit node, the RF transmitter associated with the first circuit node modulates the data onto an RF carrier frequency to provide a modulated RF signal and transmits the modulated RF signal over the transmission line. The RF receiver associated with the second circuit node receives the modulated RF signal from the transmission line and demodulates the modulated RF signal to recover the data for the second circuit node.Type: GrantFiled: January 30, 2009Date of Patent: September 18, 2012Assignee: The Regents of the University of CaliforniaInventors: Mau-Chung F. Chang, Jason Cong, Adam Kaplan, Mishali Naik, Glenn Reinman, Eran Socher, Sai-Wang Tam, Chunyue Liu
-
Patent number: 8032615Abstract: A method and system performs dynamic online multi-parameter optimization for autonomic computing systems. A simplex is maintained. The system's performance is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. A current best point in the simplex can be resampled to determine if the environment has changed. If a sufficiently different utility value is obtained from a previously sampled utility value for the point in the simplex, the simplex is expanded. If the difference is not sufficient enough, then contraction of the simplex is performed.Type: GrantFiled: May 23, 2008Date of Patent: October 4, 2011Assignee: International Business Machine CorporationInventors: Saurabh Bagchi, Rajarshi Das, Yixin Diao, Marc Adam Kaplan, Jeffrey Owen Kephart
-
Patent number: 7783728Abstract: A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.Type: GrantFiled: November 22, 2004Date of Patent: August 24, 2010Assignee: International Business Machines CorporationInventors: Mandis Sadr Mohammad Beigi, Murthy V Devarakonda, Marc Adam Kaplan, Rohit Jain, James Rubas, Upendra Sharma, Akshat Verma
-
Publication number: 20080221858Abstract: An improved method and system for performing dynamic online multi-parameter optimization for autonomic computing systems are provided. With the method and system of the present invention, a simplex, i.e. a set of points in the parameter space that has been directly sampled, is maintained. The system's performance with regard to a particular utility value is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. The method and system provide mechanisms for limiting the size of the simplex that is generated through these geometric transformations so that the present invention may be implemented in noisy environments in which the same configuration settings may lead to different results with regard to the utility value. In addition, mechanisms are provided for resampling a current best point in the simplex to determine if the environment has changed.Type: ApplicationFiled: May 23, 2008Publication date: September 11, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Saurabh Bagchi, Rajarshi Das, Yixin Diao, Marc Adam Kaplan, Jeffrey Owen Kephart
-
Publication number: 20080201366Abstract: There is provided, in a computer processing system, an apparatus for managing object data. The apparatus includes a changed objects manager for creating and managing a changed objects list that at least identifies the objects that have changed based on time of change. The changed objects list is associated with a plurality of time buckets. Each of the plurality of time buckets is associated with a respective date and time period and with object change records for objects having a timestamp falling within the respective date and time period. Each of the object change records is associated with a unique object identifier and the timestamp for a corresponding one of the objects. The timestamp specifies a date and a time corresponding to a latest one of a creation time or a most recent update time for the corresponding one of the objects.Type: ApplicationFiled: April 2, 2008Publication date: August 21, 2008Inventors: Murthy V. Devarakonda, Frank Stewart Filz, Marc Adam Kaplan, James John Seeger, Jason C. Young
-
Patent number: 7054276Abstract: A method for the multicast distribution of a message is provided. A first real machine multicasts the message through a network of message processing machines to one or more message receiving machines, wherein the network is organized into two or more cells including machines, and wherein one or more links between cells comprise link bundles. The method includes selecting a spanning tree rooted in the cell including the first real machine, and comprised of the cells and the link bundles. The method determines one or more cells for receiving the message based on the selected spanning tree and the location of the receiving machines, and selects one or more routes from among the machines and links within the cells and link bundles to a next cell. The method further routes the message to the receiving cells in the spanning tree, and delivering the message to the receiving machines within the receiving cells.Type: GrantFiled: February 7, 2001Date of Patent: May 30, 2006Assignee: International Business Machines CorporationInventor: Marc Adam Kaplan
-
Patent number: 6912713Abstract: Program product for an application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.Type: GrantFiled: February 7, 2001Date of Patent: June 28, 2005Assignee: International Business Machines CorporationInventors: Peter Richard Badovinatz, Marion Lee Blount, Larry Bert Brenner, Tushar Deepak Chandra, Ajei Sarat Gopal, Dennis Duane Jurgensen, Marc Adam Kaplan, Orvalle Theodore Kirby, John Arthur Pershing, Jr., John Joseph Edward Turek
-
Patent number: 6560742Abstract: The present invention involves a method for generating a partial Cyclic Redundancy Checking (CRC) value of a first interval of data in a digital data stream. The method includes the step of loading a precomputed CRC value corresponding to a one bit followed by a predetermined number of zeros. The predetermined number of zeros correspond to the number of digits of a polynomial minus one. The first interval of data is partitioned into a plurality of bits. The precomputed CRC value corresponding to the one bit followed by the predetermined number of zeros is enabled, for each of the plurality of bits having a value of one. The enabled, precomputed CRC values are combined to generate the partial CRC value of the first interval of data. Advantageously, multiple copies of the process may be executed in parallel to achieve a large speed-up.Type: GrantFiled: December 9, 1999Date of Patent: May 6, 2003Assignee: International Business Machines CorporationInventors: Pradeep Kumar Dubey, Sanjay Mukund Joshi, Marc Adam Kaplan
-
Publication number: 20020146008Abstract: A method for the multicast distribution of a message is provided. A first real machine multicasts the message through a network of message processing machines to one or more message receiving machines, wherein the network is organized into two or more cells including machines, and wherein one or more links between cells comprise link bundles. The method includes selecting a spanning tree rooted in the cell including the first real machine, and comprised of the cells and the link bundles. The method determines one or more cells for receiving the message based on the selected spanning tree and the location of the receiving machines, and selects one or more routes from among the machines and links within the cells and link bundles to a next cell. The method further routes the message to the receiving cells in the spanning tree, and delivering the message to the receiving machines within the receiving cells.Type: ApplicationFiled: February 7, 2001Publication date: October 10, 2002Applicant: International Business Machines CorporationInventor: Marc Adam Kaplan