会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 84. 发明授权
    • Digital signature system and method based on hard lattice problem
    • 基于硬格问题的数字签名系统和方法
    • US07237116B1
    • 2007-06-26
    • US09487502
    • 2000-01-19
    • Cynthia DworkShanmugasundaram RavikumarAmit Sahai
    • Cynthia DworkShanmugasundaram RavikumarAmit Sahai
    • H04L9/00
    • H04L9/3247H04L9/3093
    • A sender computer maps a randomized concatenation of a message μ to a point “x” in space using a function that renders it infeasible that a second message can be mapped nearby the message μ. The function can be a collision intractable or non-collision intractable function that maps the message to a point “x” on a widely-spaced grid, or the function can map the message to a point “x” of an auxiliary lattice. In either case, the sender computer, using a short basis (essentially, the private key) of a key lattice finds a lattice point “y” that is nearby the message point “x”, and then at least the points “x”, “y”, and message are sent to a receiver computer. To verity the signature, the receiver computer simply verifies that “y” is part of the lattice using a long basis (essentially, the public key), and that the distance between “x” and “y” is less than a predetermined distance, without being able or having to know how the lattice point “y” was obtained by the sender computer.
    • 发送者计算机使用使得不可能的第二个消息可以映射到消息mu附近的功能将消息mu的随机连接映射到空间中的点“x”。 该功能可以是将消息映射到广泛间隔的网格上的点“x”的碰撞难题或非碰撞难题功能,或者该功能可以将消息映射到辅助网格的点“x”。 在任一种情况下,发送者计算机使用关键格点找到位于消息点”x“附近的格点”y“,然后至少 点“x”,“y”和消息被发送到接收机计算机。 为了验证签名,接收机计算机简单地使用长的基础(基本上是公钥)验证“y”是网格的一部分,并且“x”和“y”之间的距离小于预定距离, 不能或不必知道发送者计算机如何获得格子点“y”。
    • 87. 发明授权
    • Translation model and method for matching reviews to objects
    • 用于将评论与对象进行匹配的翻译模型和方法
    • US08972436B2
    • 2015-03-03
    • US12607938
    • 2009-10-28
    • Shanmugasundaram RavikumarNilesh DalviBo PangAndrew Tomkins
    • Shanmugasundaram RavikumarNilesh DalviBo PangAndrew Tomkins
    • G06F17/30
    • G06F17/30705
    • Disclosed are methods and apparatus for matching sets of text to objects are disclosed. In accordance with one embodiment, a set of text is obtained. For instance, the set of text may include a review. A numerical value is determined for each of a plurality of objects, where the numerical value indicates a likelihood that the corresponding one of the plurality of objects is a subject of the set of text. Each of the plurality of objects has an object type defined by a set of one or more attributes, each of the set of one or more attributes having associated therewith a corresponding set of one or more parameters, wherein the numerical value is determined using the set of text and a value of each of the set of one or more parameters for each of the set of one or more attributes. One of the plurality of objects that is most likely to be the subject of the set of text is identified based upon the numerical value that has been determined for each of the plurality of objects.
    • 公开了用于将文本与对象相匹配的方法和装置。 根据一个实施例,获得一组文本。 例如,文本集可能包括一个审查。 为多个对象中的每一个确定数值,其中数值表示多个对象中的对应的一个对象是该组文本的对象的可能性。 所述多个对象中的每一个具有由一组或多个属性定义的对象类型,所述一组或多个属性中的每一个具有与其相关联的一组或多个参数,其中使用所述集合来确定所述数值 的文本以及一组或多个属性中的每一个的一个或多个参数的集合中的每一个的值。 基于为多个对象中的每一个确定的数值来识别最有可能成为该组文本的对象的多个对象中的一个。