会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明申请
    • RECOMMENDING CONTENT
    • 推荐内容
    • WO2011080138A1
    • 2011-07-07
    • PCT/EP2010/070232
    • 2010-12-20
    • THOMSON LICENSINGMASSOULIE, LaurentIOANNIDIS, Efstratios
    • MASSOULIE, LaurentIOANNIDIS, Efstratios
    • G06F17/30
    • G06F17/30867G06F3/048
    • A method for recommending content items to a user is provided. It includes: (i) receiving one of at least an acceptance input and a rejection input from a user in relation to content presented to the user; (ii) in response to an acceptance input, rendering the presented content, or in response to a rejection input, selecting fresh content for presentation; and, (iii) repeating steps (i) and (ii) until a acceptance input is received. Content is selected in dependence on a associated probability associated with that content. The probability is increased in response to an acceptance input, the increase being determined in part on a measure of a predicted reduction in user satisfaction that would be associated with an additional rejection input.
    • 提供了一种向用户推荐内容的方法。 它包括:(i)相对于呈现给用户的内容,从用户接收至少一个接受输入和拒绝输入; (ii)响应于接受输入,呈现呈现的内容,或响应于拒绝输入,选择新的内容进行呈现; 和(iii)重复步骤(i)和(ii),直到收到接受输入。 根据与该内容相关联的相关概率来选择内容。 响应于接受输入而增加概率,该增加部分地取决于与另外的拒绝输入相关联的预测的用户满意度降低的度量。
    • 14. 发明申请
    • INTERACTIVE CONTENT SEARCH USING COMPARISONS
    • 使用比较搜索的互动内容
    • WO2013119626A1
    • 2013-08-15
    • PCT/US2013/024881
    • 2013-02-06
    • TECHNICOLOR USA, INC.MASSOULIE, LaurentIOANNIDIS, Efstratios
    • MASSOULIE, LaurentIOANNIDIS, Efstratios
    • G06F17/30
    • G06F17/30451G06F17/30017G06F17/30244
    • In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding c , and the entropy of demand distribution, H . More precisely, the present principles show that the average search costs scales C F = O(c 5 H) , which improves upon the previously best known bound and is order optimal for constant c .
    • 在通过比较的交互式内容搜索中,通过从小的对象列表中找到与目标最相似的对象来执行数据库中的目标对象的搜索。 然后基于先前的选择来呈现新的对象列表。 重复该过程直到目标被包括在所呈现的列表中,此时搜索终止。 在异构需求的场景下提供了交互式内容搜索问题的解决方案,其中从不均匀的概率分布中选择目标对象。 已经假设对象被嵌入在搜索算法中完全可观察到的加倍度量空间中。 基于这些假设,提供了一种有效的基于比较的搜索方法,其查询数量的成本可以由嵌入c的倍增常数和需求分布熵H限制。更准确地说,本原理 显示平均搜索成本缩放CF = O(c 5 H),其改善了先前最为已知的界限,并且对于常数c是顺序优化的。
    • 18. 发明申请
    • INFORMATION PROPAGATION IN A NETWORK
    • 网络中的信息传播
    • WO2014095305A1
    • 2014-06-26
    • PCT/EP2013/075068
    • 2013-11-29
    • THOMSON LICENSING
    • HEGDE, NidhiMASSOULIE, LaurentBO, Jiang
    • G06Q10/10G06Q50/00G06Q30/02
    • H04L45/14G06Q10/10G06Q30/0214G06Q50/01
    • Method for managing information propagation in a network (2), said information being propagated from a source (s) to a receiving node device (k) through a path (6) of the network (2) comprising at least one edge of the network (2) directly linking a first (i) and a second (j) relaying node devices, wherein the method comprises a step of allocating to the second relaying node device (j) a score each time that the receiving node device (k) receives a useful content from the source (s) through said path (6), characterized in that the first relaying node device (i) is able to receive information from the second relaying node device (j) at a given rate, and in that the method further comprises a step of periodically updating said rate as a function of a sum of the scores allocated to the second relaying node device (j).
    • 一种用于管理网络(2)中的信息传播的方法,所述信息通过网络(2)的路径(6)从源(k)传播到接收节点设备(k),包括网络的至少一个边缘 (2)直接连接第一(i)和第二(j)中继节点设备,其中所述方法包括在每次所述接收节点设备(k)接收到的时候向所述第二中继节点设备(j)分配分数的步骤 来自所述源(6)的有用内容,其特征在于,所述第一中继节点设备(i)能够以给定的速率从所述第二中继节点设备(j)接收信息,并且所述第 方法还包括作为分配给第二中继节点设备(j)的得分的和的周期性地更新所述速率的步骤。