-
公开(公告)号：US20180018376A1
公开(公告)日：2018-01-18
申请号：US15678055
申请日：2017-08-15
Applicant: Google Inc.
Inventor： Paul T. Buchheit , Lauren M. Baptist , Bay-Wei W. Chang , Seth J. Golub , Jing Yee Lim , Sanjeev Singh , Russell R. Tuck, III
CPC classification number: G06F16/248 , G06F16/24 , G06Q10/107 , H04L51/16
Abstract: Systems and methods for storing a plurality of conversations are provided. Each such conversation has a corresponding conversation identifier and one or more messages sharing a common set of characteristics that meet predefined criteria. Information is sent to a remote computer identifying the conversations and providing sufficient information to rank them in accordance with a date/time value of a most recently received message of each conversation thereby causing a first conversation to be ordered before a second conversation. Subsequently, a first message that is deemed to belong to the second conversation is obtained and added to the second conversation. Information is resent to a remote computer identifying the plurality of conversations and providing sufficient information to rank the plurality of conversations in accordance with a date/time value of a most recently received message of each respective conversation thereby causing the first conversation to be ordered after the second conversation.
-
Patent Agency Ranking
公开(公告)号：US09734216B2
公开(公告)日：2017-08-15
申请号：US14055566
申请日：2013-10-16
Applicant: Google Inc.
Inventor： Paul T. Buchheit , Lauren M. Baptist , Bay-Wei W. Chang , Seth J. Golub , Jing Yee Lim , Sanjeev Singh , Russel R. Tuck, III
CPC classification number: G06F17/30554 , G06F17/30386 , G06Q10/107 , H04L51/16
Abstract: System and method for storing a plurality of conversations are provided. Each such conversation has a corresponding conversation identifier and one or more messages sharing a common set of characteristics that meet predefined criteria. Information is sent to a remote computer identifying the conversations and providing sufficient information to rank them in accordance with a date/time value of a most recently received message of each conversation thereby causing a first conversation to be ordered before a second conversation. Subsequently, a first message that is deemed to belong to the second conversation is obtained and added to the second conversation. Information is resent to a remote computer identifying the plurality of conversations and providing sufficient information to rank the plurality of conversations in accordance with a date/time value of a most recently received message of each respective conversation thereby causing the first conversation to be ordered after the second conversation.
-
3.发明授权Retrieving and snoozing categorized conversations in a conversation-based email system 有权在基于会话的电子邮件系统中检索和打盹分类对话公开(公告)号：US09063989B2
公开(公告)日：2015-06-23
申请号：US13900457
申请日：2013-05-22
Applicant: Google Inc.
Inventor： Paul T. Buchheit , Lauren M. Baptist , Bay-Wei W. Chang , Seth J. Golub , Jing Yee Lim , Sanjeev Singh , Russell R. Tuck, III
CPC classification number: G06F17/30554 , G06F17/30386 , G06Q10/107 , H04L51/16
Abstract: A method and system for processing messages includes receiving a plurality of messages directed to a user. Each of the plurality of messages is associated with a respective conversation and list of conversations is displayed in an order determined in accordance with second predefined criteria, as a set of rows, where each row corresponds to one of the listed conversations and includes at least a sender list, a conversation topic and a date/time value. A user is enabled to identify one or more conversations in the list of conversations, to mark the identified conversations as belonging to a particular category, and to display another list of conversations comprising conversations marked as belonging to the particular category. A user may cause a conversation to be removed from certain displays, but to become visible again after the passage of a certain amount of time or the occurrence of an event.
Abstract translation: 用于处理消息的方法和系统包括接收指向用户的多个消息。 多个消息中的每一个与相应的对话相关联，并且以按照第二预定准则确定的顺序显示会话列表作为一组行，其中每行对应于所列出的对话中的一个，并且至少包括 发件人列表，会话主题和日期/时间值。 用户能够识别对话列表中的一个或多个对话，将所识别的会话标记为属于特定类别，并且显示包括标记为属于特定类别的对话的另一个会话列表。 用户可能会使会话从某些显示中移除，但在经过一定时间或发生事件之后再次变得可见。
-
4.发明申请Retrieving and Snoozing Categorized Conversations in a Conversation-Based Email System 有权在基于对话的电子邮件系统中检索和暂停分类对话公开(公告)号：US20130262605A1
公开(公告)日：2013-10-03
申请号：US13900457
申请日：2013-05-22
Applicant: Google Inc.
Inventor： Paul T. Buchheit , Lauren M. Baptist , Bay-Wei W. Chang , Seth J. Golub , Jing Yee Lim , Sanjeev Singh , Russel R. Tuck, III
IPC: H04L12/58
CPC classification number: G06F17/30554 , G06F17/30386 , G06Q10/107 , H04L51/16
Abstract: A method and system for processing messages includes receiving a plurality of messages directed to a user. Each of the plurality of messages is associated with a respective conversation and list of conversations is displayed in an order determined in accordance with second predefined criteria, as a set of rows, where each row corresponds to one of the listed conversations and includes at least a sender list, a conversation topic and a date/time value. A user is enabled to identify one or more conversations in the list of conversations, to mark the identified conversations as belonging to a particular category, and to display another list of conversations comprising conversations marked as belonging to the particular category. A user may cause a conversation to be removed from certain displays, but to become visible again after the passage of a certain amount of time or the occurrence of an event.
Abstract translation: 用于处理消息的方法和系统包括接收指向用户的多个消息。 多个消息中的每一个与相应的对话相关联，并且以按照第二预定准则确定的顺序显示会话列表作为一组行，其中每行对应于所列出的对话中的一个，并且至少包括 发件人列表，会话主题和日期/时间值。 用户能够识别对话列表中的一个或多个对话，将所识别的会话标记为属于特定类别，并且显示包括标记为属于特定类别的对话的另一个会话列表。 用户可能会使会话从某些显示中移除，但在经过一定时间或发生事件之后再次变得可见。
-
公开(公告)号：US09961029B2
公开(公告)日：2018-05-01
申请号：US14327478
申请日：2014-07-09
Applicant: GOOGLE INC.
Inventor： Daniel Wesley Dulitz , Seth J. Golub
CPC classification number: H04L51/12 , G06Q10/107
Abstract: Systems and methods are provided that, in response to obtaining an email to a recipient from a sender, and in accordance with a determination that an indirect relationship exists between the sender and the recipient, determine a spam probability of the email by evaluating statistical information regarding the historical electronic interactions associated with the sender. In this way, the email is classified according to the identified spam probability.
-
公开(公告)号：US20140046961A1
公开(公告)日：2014-02-13
申请号：US14055566
申请日：2013-10-16
Applicant: Google Inc
Inventor： Paul T. Buchheit , Lauren M. Baptist , Bay-Wei W. Chang , Seth J. Golub , Jing Yee Lim , Sanjeev Singh , Russel R. Tuck, III
CPC classification number: G06F17/30554 , G06F17/30386 , G06Q10/107 , H04L51/16
Abstract: System and method for storing a plurality of conversations are provided. Each such conversation has a corresponding conversation identifier and one or more messages sharing a common set of characteristics that meet predefined criteria. Information is sent to a remote computer identifying the conversations and providing sufficient information to rank them in accordance with a date/time value of a most recently received message of each conversation thereby causing a first conversation to be ordered before a second conversation. Subsequently, a first message that is deemed to belong to the second conversation is obtained and added to the second conversation. Information is resent to a remote computer identifying the plurality of conversations and providing sufficient information to rank the plurality of conversations in accordance with a date/time value of a most recently received message of each respective conversation thereby causing the first conversation to be ordered after the second conversation.
Abstract translation: 提供了用于存储多个对话的系统和方法。 每个这样的对话具有相应的对话标识符和一个或多个消息，其共享符合预定标准的一组共同特征。 信息被发送到远程计算机，识别对话并提供足够的信息以根据每个会话的最近接收到的消息的日期/时间值对它们进行排名，由此导致在第二个对话之前订购第一个对话。 随后，获得被认为属于第二个会话的第一个消息，并将其添加到第二个对话。 信息被重新发送到远程计算机，识别多个对话，并且提供足够的信息以根据每个相应对话的最近接收到的消息的日期/时间值对多个对话进行排序，由此导致第一个会话在 第二次谈话
-
-
-
-
-
Search Results
6
records
(took 0.013 seconds)
