Patents by Inventor Michael Melamed

Michael Melamed 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).

  • Color image data compression
    Patent number: 9392294
    Abstract: Color image data is compressed by determining the number of colors within a cell of an input image, each cell comprising an N×M array of pixels; in response to determining that the number of colors is greater than a first predetermined threshold, compress the cell using lossy compression; and in response to determining that the number of colors is less than the first predetermined threshold, reduce the number of colors.
    Type: Grant
    Filed: July 7, 2015
    Date of Patent: July 12, 2016
    Assignee: Hewlett-Packard Indigo B.V.
    Inventors: Noam Shaham, Gideon Amir, Ram Dagan, Michael Melamed
  • COLOR IMAGE DATA COMPRESSION
    Publication number: 20150312577
    Abstract: Color image data is compressed by determining the number of colors within a cell of an input image, each cell comprising an N×M array of pixels; in response to determining that the number of colors is greater than a first predetermined threshold, compress the cell using lossy compression; and in response to determining that the number of colors is less than the first predetermined threshold, reduce the number of colors.
    Type: Application
    Filed: July 7, 2015
    Publication date: October 29, 2015
    Inventors: Noam SHAHAM, Gideon AMIR, Ram DAGAN, Michael MELAMED
  • Color image data compression
    Patent number: 9113115
    Abstract: Color image data is compressed by determining the number of colors within a cell of an input image, each cell comprising an N×M array of pixels; in response to determining that the number of colors is greater than a first predetermined threshold, compress the cell using lossy compression; and in response to determining that the number of colors is less than the first predetermined threshold, reduce the number of colors.
    Type: Grant
    Filed: July 24, 2012
    Date of Patent: August 18, 2015
    Assignee: Hewlett-Packard Indigo B.V.
    Inventors: Noam Shaham, Gideon Amir, Ram Dagan, Michael Melamed
  • Concurrent request scheduling
    Patent number: 9026748
    Abstract: A method of storage access scheduling for a memory device for a workload of different priority access requests including access requests having a real-time priority. The method includes characterizing the memory device including determining a balanced number (N) of concurrent access requests associated with a concurrent access maximum throughput associated with the memory device. The method also includes characterizing the workload. The method also includes receiving a real-time access request associated with an access request storage location value. The method also includes processing the real-time access request, utilizing a processor, based on the access request storage location value and the values obtained from characterizing the memory device and the workload.
    Type: Grant
    Filed: January 11, 2011
    Date of Patent: May 5, 2015
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Carl Staelin, Gidi Amir, Ram Dagan, David Ben Ovadia, Michael Melamed, David Edward Staas
  • COLOR IMAGE DATA COMPRESSION
    Publication number: 20140029024
    Abstract: Color image data is compressed by determining the number of colors within a cell of an input image, each cell comprising an N×M array of pixels; in response to determining that the number of colors is greater than a first predetermined threshold, compress the cell using lossy compression; and in response to determining that the number of colors is less than the first predetermined threshold, reduce the number of colors.
    Type: Application
    Filed: July 24, 2012
    Publication date: January 30, 2014
    Inventors: Noam Shaham, Gideon Amir, Ram Dagan, Michael Melamed
  • Concurrent Request Scheduling
    Publication number: 20130290656
    Abstract: A method (1400) of storage access scheduling for a memory device for a workload of different priority access requests including access requests having a real-time priority. The method includes characterizing the memory device (1402) including determining a balanced number (N) of concurrent access requests associated with a concurrent access maximum throughput associated with the memory device. The method also includes characterizing the workload (1404). The method also includes receiving a real-time access request (1406) associated with an access request storage location value. The method also includes processing the real-time access request (1408), utilizing a processor, based on the access request storage location value and the values obtained from characterizing the memory device and the workload.
    Type: Application
    Filed: January 11, 2011
    Publication date: October 31, 2013
    Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
    Inventors: Carl Staelin, Gidi Amir, Ram Dagan, David Ben Ovadia, Michael Melamed, David Edward Staas