会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明申请
    • DOCUMENT-RELATED REPRESENTATIVE INFORMATION
    • 与文件有关的代理信息
    • US20130013596A1
    • 2013-01-10
    • US13178034
    • 2011-07-07
    • Jingdong WangShipeng Li
    • Jingdong WangShipeng Li
    • G06F17/30
    • G06F17/3064
    • Some implementations include techniques and arrangements to provide document-related representative information with search results. For example, a representative query and/or representative results may be provided for one or more individual documents identified in a set of search results to supplement the search results returned in response to a received search query. The representative queries may be determined by correlating a plurality of previously submitted queries in search log data with a plurality of documents returned in response to the queries. In some implementations, click-through frequency for a particular document with respect to the plurality of queries may be taken into consideration when determining the representative queries for the particular document. In some implementations, the representative queries serve to categorize the search results based on subject matter, and a link may be provided to representative results corresponding to the representative query for accessing documents directed to similar subject matter.
    • 一些实现包括用于向搜索结果提供与文档相关的代表性信息的技术和布置。 例如,可以为在一组搜索结果中标识的一个或多个单独文档提供代表性查询和/或代表性结果,以补充响应于所接收的搜索查询返回的搜索结果。 可以通过将搜索日志数据中的多个先前提交的查询与响应于查询而返回的多个文档相关联来确定代表性查询。 在一些实现中,当确定特定文档的代表性查询时,可以考虑针对多个查询的特定文档的点击频率。 在一些实现中,代表性查询用于基于主题对搜索结果进行分类,并且可以向链接提供对应于代表性查询的代表性结果,用于访问针对相似主题的文档。
    • 24. 发明申请
    • Optimized KD-Tree for Scalable Search
    • 用于可扩展搜索的优化KD树
    • US20120117122A1
    • 2012-05-10
    • US12940880
    • 2010-11-05
    • Jingdong WangXian-Sheng HuaShipeng LiYou Jia
    • Jingdong WangXian-Sheng HuaShipeng LiYou Jia
    • G06F17/30
    • G06F17/3028G06F17/30333
    • Techniques for constructing an optimized kd-tree are described. In an implementation, an optimized kd-tree process receives input of a set of data points applicable for large-scale computer vision applications. The process divides the set of the data points into subsets of data points with nodes while generating hyperplanes (e.g., coordinate axes). The process identifies a partition axis for each node based on the coordinate axes combined in a binary way. The optimized kd-tree process creates an optimized kd-tree that organizes the data points based on the identified partition axis. The organization of the data points in the optimized kd-tree provides efficient indexing and searching for a nearest neighbor.
    • 描述了构建优化的kd-tree的技术。 在一个实现中,优化的kd-tree过程接收适用于大规模计算机视觉应用的一组数据点的输入。 该过程在产生超平面(例如,坐标轴)的同时将数据点的集合划分成具有节点的数据点的子集。 该过程基于以二进制方式组合的坐标轴来识别每个节点的分区轴。 优化的kd-tree过程创建一个优化的kd-tree,它根据识别的分区轴组织数据点。 优化的kd-tree中数据点的组织为最近邻居提供了有效的索引和搜索。
    • 28. 发明授权
    • Video concept detection using multi-layer multi-instance learning
    • 使用多层多实例学习的视频概念检测
    • US08804005B2
    • 2014-08-12
    • US12111202
    • 2008-04-29
    • Tao MeiXian-Sheng HuaShipeng LiZhiwei Gu
    • Tao MeiXian-Sheng HuaShipeng LiZhiwei Gu
    • G06K9/62G06K9/34
    • G11B27/28G06K9/00711G06K9/6282
    • Visual concepts contained within a video clip are classified based upon a set of target concepts. The clip is segmented into shots and a multi-layer multi-instance (MLMI) structured metadata representation of each shot is constructed. A set of pre-generated trained models of the target concepts is validated using a set of training shots. An MLMI kernel is recursively generated which models the MLMI structured metadata representation of each shot by comparing prescribed pairs of shots. The MLMI kernel is subsequently utilized to generate a learned objective decision function which learns a classifier for determining if a particular shot (that is not in the set of training shots) contains instances of the target concepts. A regularization framework can also be utilized in conjunction with the MLMI kernel to generate modified learned objective decision functions. The regularization framework introduces explicit constraints which serve to maximize the precision of the classifier.
    • 视频剪辑中包含的视觉概念基于一组目标概念进行分类。 剪辑被分割成镜头,并且构建每个镜头的多层多实例(MLMI)结构化元数据表示。 使用一组训练镜头验证了一组预先生成的目标概念训练模型。 通过比较规定的拍摄对,递归地生成MLMI内核,以对每个镜头的MLMI结构化元数据表示进行建模。 MLMI内核随后被用于生成学习的客观决策函数,该函数学习用于确定特定镜头(不在该组训练镜头中)是否包含目标概念的实例的分类器。 正则化框架也可以与MLMI内核一起使用,以生成修改后的学习目标决策函数。 正则化框架引入明确的约束,用于最大化分类器的精度。
    • 29. 发明申请
    • Cooperative Web Browsing Using Multiple Devices
    • 使用多个设备的合作网页浏览
    • US20140053054A1
    • 2014-02-20
    • US13585185
    • 2012-08-14
    • Huifeng ShenShipeng LiYan LuZhaotai PanJianfeng Wang
    • Huifeng ShenShipeng LiYan LuZhaotai PanJianfeng Wang
    • G06F15/16G06F17/00
    • G06F17/30905
    • A proxy-based thin-client web browsing framework enables cooperative web browsing of multiple devices. The multiple devices may include devices that are not intended for web browsing and have limited or no web browsers and/or user input capabilities. The proxy-based thin client web browsing framework employs a virtual browser at a proxy server to perform all browser-engine logics, and retrieve, render and encode web pages on behalf of the multiple devices. The multiple devices therefore only need to have limited decoding and display capabilities to perform web browsing. The proxy-based thin client web browsing framework further includes a touch controller as a remote controller for a device that has no or limited user texting or manipulating capabilities.
    • 基于代理的瘦客户端Web浏览框架可实现多个设备的协同网页浏览。 多个设备可以包括不用于网页浏览的设备,并且具有有限的或没有web浏览器和/或用户输入能力的设备。 基于代理的瘦客户端Web浏览框架在代理服务器上使用虚拟浏览器来执行所有浏览器引擎逻辑,并且代表多个设备检索,呈现和编码网页。 因此,多个设备仅需要具有有限的解码和显示功能来执行网页浏览。 基于代理的瘦客户机web浏览框架还包括作为用于没有或限制用户发短信或操纵能力的设备的遥控器的触摸控制器。
    • 30. 发明授权
    • Enhancing photo browsing through music and advertising
    • 通过音乐和广告加强照片浏览
    • US08504422B2
    • 2013-08-06
    • US12786020
    • 2010-05-24
    • Tao MeiXian-Sheng HuaShipeng LiJinlian GuoFei Sheng
    • Tao MeiXian-Sheng HuaShipeng LiJinlian GuoFei Sheng
    • G06Q30/00
    • G06F17/30056G06F17/30047G06Q30/02G06Q30/0243
    • Techniques for recommending music and advertising to enhance a user's experience while photo browsing are described. In some instances, songs and ads are ranked for relevance to at least one photo from a photo album. The songs, ads and photo(s) from the photo album are then mapped to a style and mood ontology to obtain vector-based representations. The vector-based representations can include real valued terms, each term associated with a human condition defined by the ontology. A re-ranking process generates a relevancy term for each song and each ad indicating relevancy to the photo album. The relevancy terms can be calculated by summing weighted terms from the ranking and the mapping. Recommended music and ads may then be provided to a user, as the user browses a series of photos obtained from the photo album. The ads may be seamlessly embedded into the music in a nonintrusive manner.
    • 描述用于推荐音乐和广告以提高用户在照相浏览时体验的技术。 在某些情况下,歌曲和广告的排名与相册中的至少一张照片相关。 然后将相册中的歌曲,广告和照片映射到风格和心境本体以获得基于矢量的表示。 基于向量的表示可以包括实际值,每个术语与由本体定义的人类条件相关联。 重新排序过程产生每个歌曲的相关术语,每个广告指示相册的相关性。 可以通过从排名和映射求和加权项来计算相关项。 然后,当用户浏览从相册获得的一系列照片时,推荐的音乐和广告可以被提供给用户。 广告可以无缝地嵌入到音乐中。