会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • BIASING GEOCODING OF QUERIES
    • 偏心地球物理学
    • US20130268540A1
    • 2013-10-10
    • US13442568
    • 2012-04-09
    • Luuk van DijkIngemar ErikssonIvan ZauharodneuFinnegan SoutheyNils Richard EkwallFabrice CailletteDavid Blackman
    • Luuk van DijkIngemar ErikssonIvan ZauharodneuFinnegan SoutheyNils Richard EkwallFabrice CailletteDavid Blackman
    • G06F17/30
    • G06F16/9537G06F16/29H04W4/029
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for receiving a search query originating from a user device, the search query including a geographic feature name; receiving data identifying one or more candidate point-of-interests, each candidate point-of-interest comprising data that identifies a corresponding candidate geographic entity, each candidate point-of-interest having an initial relevance score; generating one or more biasing boxes, wherein each biasing box defines a geographic region, and each biasing box is defined based on location information associated with the user device or a user using the user device; using the biasing boxes to generate respective adjusted relevance scores for the candidate point-of-interests; selecting a point-of-interest from the one or more candidate point-of-interests according to the respective adjusted relevance scores of the candidate point-of-interests; and using the selected point-of-interest to identify a location relevant to the search query.
    • 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于接收源自用户设备的搜索查询,所述搜索查询包括地理特征名称; 接收识别一个或多个候选利益点的数据,每个候选兴趣点包括标识对应候选地理实体的数据,每个候选利益点具有初始相关性得分; 生成一个或多个偏置框,其中每个偏置框定义地理区域,并且基于与所述用户设备或使用所述用户设备的用户相关联的位置信息来定义每个偏移框; 使用偏置框来为候选兴趣点生成各自调整的相关性分数; 根据候选利益点的各自调整的相关性分数,从一个或多个候选利益点选择兴趣点; 并使用所选择的兴趣点识别与搜索查询相关的位置。
    • 5. 发明授权
    • Interpreting adjacent search terms based on a hierarchical relationship
    • 基于层次关系解释相邻搜索项
    • US08745028B1
    • 2014-06-03
    • US13452179
    • 2012-04-20
    • Luuk Van DijkIvan Zauharodneu
    • Luuk Van DijkIvan Zauharodneu
    • G06F17/30
    • G06F17/30522G06F17/30106G06F17/30675
    • A computer-implemented method may include receiving, from a device, a search query that includes search terms, parsing the search terms into combinations of search terms, where each of the combinations includes one or more adjacent search terms, determining whether a hierarchical relationship exists for the one or more adjacent search terms of each of the combinations, generating one or more interpretations for each of the combinations based on whether the hierarchical relationship exists for the one or more adjacent search terms, performing a search based on at least one of the one or more interpretations to identify search results, generating a search result document containing the search results, and providing, to the device, the search result document.
    • 计算机实现的方法可以包括从设备接收包括搜索项的搜索查询,将搜索项解析成搜索项的组合,其中每个组合包括一个或多个相邻搜索项,确定是否存在分层关系 对于每个组合的一个或多个相邻搜索项,基于是否存在针对所述一个或多个相邻搜索项的分层关系来生成针对每个组合的一个或多个解释,基于所述组合中的至少一个执行搜索 识别搜索结果的一个或多个解释,生成包含搜索结果的搜索结果文档,以及向该设备提供搜索结果文档。
    • 6. 发明授权
    • Simhash based spell correction
    • 基于Simhash的拼写修正
    • US08661341B1
    • 2014-02-25
    • US13009189
    • 2011-01-19
    • Luuk van Dijk
    • Luuk van Dijk
    • G06F17/00
    • G06F17/273
    • Methods, systems, and apparatus for performing simhash based spell correction are provided. A character string is simhashed to generate a simhashed character string. A plurality of substrings is extracted from the character string by applying a sliding window of at least two characters to the character string. The plurality of substrings are hashed to produce a plurality of corresponding hash values. Each hash value is processed to generate a simhashed character string. The simhashed character string is then compared with character strings within a simhashed dictionary dataset to determine at least one candidate to replace the character string. Processing each hash value includes extracting a set of lowest bits from each hash value, and mapping each set of lowest bits to the bitmask.
    • 提供了用于执行基于simhash的拼写修正的方法,系统和装置。 字符串被simhashed生成一个simhashed字符串。 通过将至少两个字符的滑动窗口应用于字符串,从字符串中提取多个子串。 多个子串被散列以产生多个对应的散列值。 处理每个哈希值以生成一个相似的字符串。 然后将simhashed字符串与字母数据集中的字符串进行比较,以确定至少一个替换字符串的候选项。 处理每个散列值包括从每个散列值提取一组最低位,并将每组最低位映射到位掩码。
    • 7. 发明申请
    • Caching Input Suggestions
    • 缓存输入意见
    • US20130054632A1
    • 2013-02-28
    • US13221655
    • 2011-08-30
    • Luuk van DijkSteffen Meschkat
    • Luuk van DijkSteffen Meschkat
    • G06F17/30
    • G06F16/90324
    • Methods, systems, and apparatus, including computer program products, for caching input suggestions are provided. In one aspect, a method includes receiving a first textual input in an input field from a user; sending the first textual input to a server before a user submits a request for results based on the first textual input; receiving a set of input suggestions from the server; storing the set of input suggestions in a local cache; displaying a first subset of input suggestions from the set of input suggestions to the user; receiving additional textual input from the user after the first textual input is sent to the server; analyzing the stored set of input suggestions to identify a new subset of input suggestions based on the additional textual input; and displaying the new subset of input suggestions.
    • 提供了用于缓存输入建议的方法,系统和设备,包括计算机程序产品。 一方面,一种方法包括从用户接收输入字段中的第一文本输入; 在用户基于第一文本输入提交结果请求之前将第一文本输入发送到服务器; 从服务器接收一组输入建议; 将一组输入建议存储在本地高速缓存中; 将一组输入建议的输入建议的第一子集显示给用户; 在将第一个文本输入发送到服务器之后,从用户接收额外的文本输入; 分析存储的一组输入建议,以基于附加文本输入来识别输入建议的新子集; 并显示新的输入建议子集。
    • 10. 发明授权
    • Scheduling of tasks based upon historical execution times
    • 根据历史执行时间安排任务
    • US08555281B1
    • 2013-10-08
    • US13028935
    • 2011-02-16
    • Luuk van DijkAndras ErdeiNils Richard Ekwall
    • Luuk van DijkAndras ErdeiNils Richard Ekwall
    • G06F9/46
    • G06F9/4881
    • Methods, systems, and implementations are disclosed to schedule a plurality of tasks on one or more processors. The tasks may be part of a larger job based on a user initiated query for information retrieval. One example method of operation may include estimating, based upon historical actual execution times of tasks of a respective corresponding type, an expected execution time for each task of the plurality of tasks. The method may further include scheduling the plurality of tasks for execution on the one or more processors based upon the estimated expected execution time of each task. The scheduling procedure utilized ultimately produces an optimized task execution schedule, and in turn, minimizes the expected job completion time.
    • 公开了方法,系统和实现以在一个或多个处理器上调度多个任务。 基于用户启动的信息检索查询,任务可能是较大作业的一部分。 一种示例性操作方法可以包括基于各个对应类型的任务的历史实际执行时间来估计多个任务的每个任务的预期执行时间。 该方法还可以包括基于每个任务的估计的预期执行时间来调度在一个或多个处理器上执行的多个任务。 所使用的调度过程最终产生优化的任务执行计划,并且进而使预期的作业完成时间最小化。