Patents by Inventor Yuval Peduel

Yuval Peduel 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: 10594640
    Abstract: One or more computing devices, systems, and/or methods for message classification are provided. For example, a set of messages is clustered into a set of clusters. A cluster comprises messages with similar features (e.g., similar subject lines, message body content, sender information, recipient information, structure, user action such as reading or deleting, spam vote information, etc.). Cluster features are computed for the clusters based upon features of messages within such clusters. A first table, comprising cluster entries corresponding cluster features of clusters, and a second table, comprising message entries corresponding to clusters to which messages are assigned, are created. Message features of a message are created, using the first table and second table, based upon features of the message and cluster features of clusters to which the message is assigned. A message classifier is used to classify the message (e.g., spam, safe, a threat, etc.) based upon the message features.
    Type: Grant
    Filed: December 1, 2016
    Date of Patent: March 17, 2020
    Assignee: Oath Inc.
    Inventors: David Pal, Satyen Chandrakant Kale, Yongxin Xi, Ilambharathi Kanniah, Yuval Peduel, Zohar Shay Karnin, Jyh-Shin Shue
  • Publication number: 20180159808
    Abstract: One or more computing devices, systems, and/or methods for message classification are provided. For example, a set of messages is clustered into a set of clusters. A cluster comprises messages with similar features (e.g., similar subject lines, message body content, sender information, recipient information, structure, user action such as reading or deleting, spam vote information, etc.). Cluster features are computed for the clusters based upon features of messages within such clusters. A first table, comprising cluster entries corresponding cluster features of clusters, and a second table, comprising message entries corresponding to clusters to which messages are assigned, are created. Message features of a message are created, using the first table and second table, based upon features of the message and cluster features of clusters to which the message is assigned. A message classifier is used to classify the message (e.g., spam, safe, a threat, etc.) based upon the message features.
    Type: Application
    Filed: December 1, 2016
    Publication date: June 7, 2018
    Inventors: David Pal, Satyen Chandrakant Kale, Yongxin Xi, Ilambharathi Kanniah, Yuval Peduel, Zohar Shay Karnin, Jyh-Shin Shue
  • Patent number: 7016302
    Abstract: An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to be transferred on the link is defined. A data limit value is assigned to each of the queues to limit the amount of data that can be forwarded from each queue. The data limit value is derived from the bandwidth value for the link. By placing bandwidth-related limits on the queues, low-priority queues are prevented from being dominated by high-priority queues, that is, low-priority queues are not prevented from forwarding their data by the priority structure. Also, the bandwidth-related limits allow for control of traffic flow to prevent overloading lower-capacity links on the network.
    Type: Grant
    Filed: August 16, 2000
    Date of Patent: March 21, 2006
    Assignee: IronBridge Networks, Inc.
    Inventors: Karen M. Schramm, Steven J. Schwartz, Leo J. Keegan, Yuval Peduel
  • Patent number: 6870849
    Abstract: An apparatus and method for efficient hashing uses both an identifying portion of a data packet, e.g., source and destination ID, and an identifying value of the node, e.g., the IP address of the node, to generate a hash result. By inserting a unique value into the hash operation at each node, the invention effectively provides for a different hash implementation at each node. As a result, in situations where multiple paths or multiple links within a path are available to forward packets, traffic can be split over the multiple paths and links. Inefficient utilization of network links found in prior systems which use the same hash operation at each node are eliminated.
    Type: Grant
    Filed: July 6, 2000
    Date of Patent: March 22, 2005
    Inventors: Ross W. Callon, James D. Carlson, Douglas C. Ehlert, Yuval Peduel
  • Patent number: 6434115
    Abstract: A switching node for transferring packets, each including a destination address, in a network includes a plurality of input port modules, a plurality of output port modules and a switching fabric, including a packet meta-data processor and a packet switch. Each input port module is connected to a communication link for receiving packets thereover, and each output port module is connected to a communication link for transmitting packets thereover. Each input port module, upon receiving a packet, buffers the packet and generates a meta-data packet therefor identifying the output port module that is to transmit the packet and packet identifier information, and provides it to the packet meta-data processor.
    Type: Grant
    Filed: July 2, 1998
    Date of Patent: August 13, 2002
    Assignee: Pluris, Inc.
    Inventors: Steven J. Schwartz, James D. Carlson, Yuval Peduel, Michael Hathaway