专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20180137115A1 HIGH PERFORMANCE PARALLEL INDEXING FOR FORENSICS AND ELECTRONIC DISCOVERY 审中-公开
公开(公告)号：US20180137115A1
公开(公告)日：2018-05-17
申请号：US15351733
申请日：2016-11-15
申请人： SAP SE
发明人： Udo Klein , Philipp Scholl
IPC分类号： G06F17/30
CPC分类号： G06F16/313 , G06F16/325
摘要： A system, a method and a computer program product for indexing data samples are disclosed. A locality-sensitive string hash index is determined for each data sample in a plurality of data samples. The determined locality-sensitive string hash indexes for at least two data samples in the plurality of data samples are compared. The comparison includes estimating, based on the determined locality-sensitive string hash indexes, a distance between the two data samples. Based on the comparison, at least one data sample in the plurality of data samples being similar to at least another data sample in the plurality of data samples is identified.

2. 发明申请

US20160012126A1 SYSTEM FOR SEARCHING, RECOMMENDING, AND EXPLORING DOCUMENTS THROUGH CONCEPTUAL ASSOCIATIONS 审中-公开
标题翻译：通过概念协会搜索，推荐和探索文件的制度
公开(公告)号：US20160012126A1
公开(公告)日：2016-01-14
申请号：US14657391
申请日：2015-03-13
申请人： International Business Machines Corporation
发明人： Michele M. Franceschini , Luis A. Lastras-Montano , John T. Richards , Livio B. Soares , Mark N. Wegman
IPC分类号： G06F17/30
CPC分类号： G06F16/325 , G06F16/3344 , G06F16/3346 , G06F16/951
摘要： According to an aspect, searching, recommending, and exploring documents through conceptual associations includes a method for receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. The method also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. The method also includes outputting a list that is responsive to the one or more retrieved lists.
摘要翻译：根据一个方面，通过概念关联搜索，推荐和探索文档包括用于从每个文档中接收多个文档并提取概念的方法。计算知识库中每个文档和概念之间的关系程度。响应于接收到查询，该方法还包括从查询确定一个或多个概念。对于每个概念，检索与该概念具有最高程度关系的文档的列表。该方法还包括输出响应于一个或多个检索到的列表的列表。

3. 发明申请

US20040049493A1 String matching process for ASCII strings using two arrays and hash table 审中-公开
标题翻译：使用两个数组和哈希表的ASCII字符串的字符串匹配过程
公开(公告)号：US20040049493A1
公开(公告)日：2004-03-11
申请号：US10236365
申请日：2002-09-05
发明人： Andrew Davis
IPC分类号： G06F007/00
CPC分类号： G06F16/90344 , G06F16/325
摘要： A method of recognizing an input string is disclosed. The method entails searching a prefix length table (PLT) for lengths of potential matching strings using one or more characters of the input string, generating hash keys respectively comprising the input string and lengths of potential matching strings, and searching a hash table using the hash keys to find a hash entry containing a string matching the input string.
摘要翻译：公开了一种识别输入串的方法。该方法需要使用输入字符串的一个或多个字符来搜索潜在匹配字符串的长度的前缀长度表（PLT），生成分别包括输入字符串和潜在匹配字符串长度的散列键，以及使用散列表搜索散列表键来查找包含与输入字符串匹配的字符串的哈希条目。

4. 发明申请

US20180278586A1 KEYED HASH CONTACT TABLE 审中-公开
公开(公告)号：US20180278586A1
公开(公告)日：2018-09-27
申请号：US15467876
申请日：2017-03-23
申请人： Microsoft Technology Licensing, LLC
发明人： Daniel J. Driscoll , James H. Lewallen , Christopher C. McConnell , Thomas M. Laird-McConnell
IPC分类号： H04L29/06 , H04L9/08 , H04L9/06 , G06F17/30 , H04L9/14 , H04L12/58 , H04W4/14
CPC分类号： H04L63/0428 , G06F16/325 , G06F21/64 , H04L9/0643 , H04L9/0662 , H04L51/22 , H04L2209/80 , H04W4/14
摘要： In an example, a method includes receiving a data package, the data package including a contact identification and a message payload; in response to determining that a key for the contact identification does not exist in a contact table: generating a key for the contact identification; and updating the contact table with the generated key to indicate an association between the key and the contact identification; calculating a hashed identification based on the generated key and contact identification; and associating the message payload with the hashed identification in a message table.

5. 发明申请

US20170177705A1 CLUSTERING USING LOCALITY-SENSITIVE HASHING WITH IMPROVED COST MODEL 审中-公开
公开(公告)号：US20170177705A1
公开(公告)日：2017-06-22
申请号：US15453754
申请日：2017-03-08
申请人： Facebook, Inc.
发明人： Grzegorz MALEWICZ
IPC分类号： G06F17/30
CPC分类号： G06F16/285 , G06F16/2255 , G06F16/24545 , G06F16/248 , G06F16/325 , G06F16/35 , G06F16/58 , G06F16/951
摘要： Embodiments are disclosed for using an improved locality sensitive hashing (LSH) operation for the K-means clustering algorithm. In some embodiments, parameters of an LSH function are optimized with respect to a new cost model. In other embodiments, an LSH operation is applied with optimized parameters to a K-means clustering algorithm.

6. 发明申请

US20170083610A1 METHOD AND AN APPARATUS FOR FAST MERGING INVERTED CHAINS 审中-公开
公开(公告)号：US20170083610A1
公开(公告)日：2017-03-23
申请号：US15270725
申请日：2016-09-20
申请人： GUANGZHOU SHENMA MOBILE INFORMATION TECHNOLOGY CO., LTD.
发明人： GANG WANG , MINGCHENG WAN , HONGLEI ZENG
IPC分类号： G06F17/30
CPC分类号： G06F16/319 , G06F16/325 , G06F16/334
摘要： In accordance with various embodiments of the disclosed subject matter, a method for fast merging inverted chains, and a related apparatus are provided. In some embodiments, the method comprises: pre-setting an inverted index including a plurality of inverted chains and recording a length of each inverted chain; searching the inverted index and obtaining a subset of the plurality of inverted chains that correspond to at least one keyword; sorting the subset of the plurality of inverted chains in an ascending order of the lengths of the subset of multiple inverted chains; and merging the subset of the plurality of inverted chains sequentially as the ascending order starting from one of the subset of the plurality of inverted chains that has the shortest length.

7. 发明申请

US20170011120A1 MULTIPLE SUB-STRING SEARCHING 审中-公开
标题翻译：多个SUB-STRING搜索
公开(公告)号：US20170011120A1
公开(公告)日：2017-01-12
申请号：US14842866
申请日：2015-09-02
申请人： International Business Machines Corporation
发明人： Chi-Wai Cheung , Ying-Chau R. Mak
IPC分类号： G06F17/30
CPC分类号： G06F16/334 , G06F16/325 , G06F16/90344
摘要： A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.
摘要翻译：提供了一种用于搜索原始文本的多个子串的方法。接收到搜索查询，其中搜索查询包括多个子串。分配了一个散列数组。散列数组至少部分地具有基于多个子串和原始文本的大小。哈希数组用多个散列值填充，其中使用滚动散列函数生成多个哈希值，并且其中多个散列值中的每一个对应于原始文本的一部分。基于多个子串来计算多个子串值。至少部分地，多个子串中的每一个被确定为在原始文本中出现，用于搜索多个子串值的散列数组。

8. 发明申请

US20160012044A1 SYSTEM FOR SEARCHING, RECOMMENDING, AND EXPLORING DOCUMENTS THROUGH CONCEPTUAL ASSOCIATIONS 审中-公开
标题翻译：通过概念协会搜索，推荐和探索文件的制度
公开(公告)号：US20160012044A1
公开(公告)日：2016-01-14
申请号：US14330358
申请日：2014-07-14
申请人： International Business Machines Corporation
发明人： Michele M. Franceschini , Luis A. Lastras-Montano , John T. Richards , Livio B. Soares , Mark N. Wegman
IPC分类号： G06F17/30
CPC分类号： G06F16/325 , G06F16/3344 , G06F16/3346 , G06F16/951
摘要： According to an aspect, searching, recommending, and exploring documents through conceptual associations includes receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. An aspect also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. An aspect also includes outputting a list that is responsive to the one or more retrieved lists.
摘要翻译：根据一个方面，通过概念关联搜索，推荐和探索文档包括从每个文档接收多个文档并提取概念。计算知识库中每个文档和概念之间的关系程度。响应于接收到查询，方面还包括从查询确定一个或多个概念。对于每个概念，检索与该概念具有最高程度关系的文档的列表。方面还包括输出响应于一个或多个检索到的列表的列表。

9. 发明申请

US20180174037A1 SUGGESTING RESOURCES USING CONTEXT HASHING 审中-公开
公开(公告)号：US20180174037A1
公开(公告)日：2018-06-21
申请号：US15383603
申请日：2016-12-19
申请人： ASAPP, INC
发明人： Shawn Henry
IPC分类号： G06N3/08 , G06F17/30 , G06Q30/00
CPC分类号： G06N3/08 , G06F16/325 , G06F16/3322 , G06F16/335 , G06F16/338 , G06N3/0445 , G06N3/0454 , G06Q30/016 , H04L51/18
摘要： A first user and a second user may exchange messages during a session and the exchanged messages may be processed to suggest resources to the first user. For example, the first user may be a customer service representative assisting a customer, and the suggested resources may include text of a message to send to the customer. The resources may be suggested by computing a semantic representation of the messages in the session, computing a context vector that describes a context of the session, computing a context hash vector from the context vector, and retrieving one or more resources from a data store of resources using the context hash vector. Information about a resource may be presented to the first user to assist the first user in responding to the second user.

10. 发明申请

US20180075090A1 Computer-Implemented System And Method For Identifying Similar Documents 审中-公开
公开(公告)号：US20180075090A1
公开(公告)日：2018-03-15
申请号：US15715025
申请日：2017-09-25
申请人： FTI Consulting, Inc.
发明人： William C. Knight , Steve Antoch , Sean M. McNee
IPC分类号： G06F17/30
CPC分类号： G06F16/24 , G06F16/325
摘要： A computer-implemented system and method for identifying similar documents is provided. A set of documents is obtained. Each document in the set is divided into segments and the segments are hashed. The hashed segments of at least two of the documents are compared. Hashed segments shared between the at least two documents are identified. A number of the hashed segments shared between the at least two documents is summed and a total number of hashed segments within the at least two documents is summed. A ratio of similarity between the at least two documents is determined based on the number of shared hashed segments and the total number of hashed segments.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式