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

31. 发明申请

US20100205213A1 NON-EXACT CACHE MATCHING 审中-公开
标题翻译：非精确缓存匹配
公开(公告)号：US20100205213A1
公开(公告)日：2010-08-12
申请号：US12370306
申请日：2009-02-12
申请人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
发明人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
IPC分类号： G06F17/30 , G06F12/08
CPC分类号： G06Q30/0251 , G06F16/24539 , G06Q10/06
摘要： The subject matter disclosed herein relates to returning cached object results based at least in part on a non-exact comparison with a query key.
摘要翻译：本文公开的主题涉及至少部分地基于与查询密钥的非精确比较来返回缓存的对象结果。

32. 发明授权

US07734629B2 System and method using hierachical clustering for evolutionary clustering of sequential data sets 有权
标题翻译：使用层次聚类的序列数据集的进化聚类的系统和方法
公开(公告)号：US07734629B2
公开(公告)日：2010-06-08
申请号：US11414442
申请日：2006-04-29
申请人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F7/00
CPC分类号： G06F17/30705 , G06K9/6218
摘要： An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.
摘要翻译：提供了一种用于顺序数据集进化聚类的改进的系统和方法。可以确定用于表示所使用的特定聚类方法的数据集的快照成本，并且可以独立于序列中的数据集的一系列聚类来确定数据集的聚类成本。还可以确定历史成本用于测量数据集的相应簇之间的距离和数据集序列中的先前数据集之间的距离，以确定数据集的聚类成本，作为数据集的一系列聚类的一部分序列。可以通过最小化快照成本和历史成本的组合来确定用于对数据集进行聚类的总体成本。可以使用任何聚类方法，包括平面聚类和层次聚类。

33. 发明授权

US07596587B2 Multi-tiered storage 有权
标题翻译：多层存储
公开(公告)号：US07596587B2
公开(公告)日：2009-09-29
申请号：US11489885
申请日：2006-07-19
申请人： Pavel Berkhin , Usama M. Fayyad , Shanmugasundaram Ravikumar
发明人： Pavel Berkhin , Usama M. Fayyad , Shanmugasundaram Ravikumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30221 , G06F3/0605 , G06F3/0631 , G06F3/0685 , Y10S707/99931 , Y10S707/99955
摘要： Methods and apparatus are described for storing a plurality of objects in a plurality of storage options. An importance index is generated for each of the plurality of objects with reference to importance data associated with each object. At least a portion of the importance data represents relevance of the associated object relative to a population of users interacting with the plurality of objects. Each of the objects is stored in a selected one of the storage options with reference to the corresponding importance index and a hierarchy of the storage options. The hierarchy of storage options represents at least partial ordering of the storage options with reference to economic costs and efficiency of retrieval.
摘要翻译：描述了用于将多个对象存储在多个存储选项中的方法和装置。参考与每个对象相关联的重要性数据，为多个对象中的每一个生成重要性索引。重要性数据的至少一部分表示相关对象相对于与多个对象交互的用户群体的相关性。参考相应的重要性索引和存储选项的层次结构，将每个对象存储在选定的一个存储选项中。参考经济成本和检索效率，存储选项的层次结构至少代表存储选项的部分排序。

34. 发明申请

US20090216710A1 OPTIMIZING QUERY REWRITES FOR KEYWORD-BASED ADVERTISING 审中-公开
标题翻译：优化基于关键字广告的查询
公开(公告)号：US20090216710A1
公开(公告)日：2009-08-27
申请号：US12038259
申请日：2008-02-27
申请人： Chi-Chao Chang , Shanmugasundaram Ravikumar , Azarakhsh Malekian , Grant Wang
发明人： Chi-Chao Chang , Shanmugasundaram Ravikumar , Azarakhsh Malekian , Grant Wang
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F16/3338
摘要： A system and method are disclosed for rewriting queries. The queries may be rewritten and evaluated based on an end benefit, such as an optimum advertising benefit. Queries may be associated with advertisements and the benefit of those advertisements may be used in selecting query rewrites for an original user query. Multiple query rewrites from various techniques may be analyzed to generate a subset of query rewrites that are optimized for a particular benefit.
摘要翻译：公开了用于重写查询的系统和方法。这些查询可以基于最终的益处来重写和评估，例如最佳的广告收益。查询可以与广告相关联，并且这些广告的优点可以用于为原始用户查询选择查询重写。可以分析来自各种技术的多个查询重写以生成针对特定优点而优化的查询重写子集。

35. 发明申请

US20090157646A1 MITIGATION OF SEARCH ENGINE HIJACKING 有权
标题翻译：搜索引擎重新安装
公开(公告)号：US20090157646A1
公开(公告)日：2009-06-18
申请号：US11956055
申请日：2007-12-13
申请人： Shanmugasundaram Ravikumar , Bo Pang
发明人： Shanmugasundaram Ravikumar , Bo Pang
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： The subject matter disclosed herein relates to mitigation of search engine hijacking.
摘要翻译：本文公开的主题涉及减轻搜索引擎劫持。

36. 发明申请

US20080263026A1 Techniques for detecting duplicate web pages 有权
标题翻译：检测重复网页的技术
公开(公告)号：US20080263026A1
公开(公告)日：2008-10-23
申请号：US11788505
申请日：2007-04-20
申请人： Amit Sasturkar , Rajat Ahuja , Shanmugasundaram Ravikumar , Vladimir Ofitserov
发明人： Amit Sasturkar , Rajat Ahuja , Shanmugasundaram Ravikumar , Vladimir Ofitserov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/2211
摘要： Techniques are disclosed for detecting web pages with duplicate content. In one embodiment, a set of shingles is computed for each page of a group of pages. An aggregate set of shingles is determined based on the sets of shingles computed for the group of pages. A first subset from the aggregate set of shingles is determined by selecting, from the aggregate set, shingles whose frequencies in the aggregate set exceed a specified threshold. A modified set of shingles is generated for each page of the group of pages by removing, from the set of shingles for that page, any shingle included in the first subset. One or more duplicate pages in the group of pages are determined based at least in part on the modified sets of shingles generated for the group of pages.
摘要翻译：公开了用于检测具有重复内容的网页的技术。在一个实施例中，针对一组页面的每个页面计算一组带状块。基于为该组页面计算的带状块的集合确定聚合的带状块组。通过从聚合集合中选择聚合集合中的频率超过指定阈值的带状键确定来自聚合散列集合的第一子集。通过从该页面的一组带状键移除包括在第一子集中的任何瓦片，为该组页面的每个页面生成经修改的带状块组。至少部分地基于为该组页生成的带状块的修改的集合来确定该组页面中的一个或多个重复页面。

37. 发明申请

US20070255736A1 System and method using hierachical clustering for evolutionary clustering of sequential data sets 有权
标题翻译：使用层次聚类的序列数据集的进化聚类的系统和方法
公开(公告)号：US20070255736A1
公开(公告)日：2007-11-01
申请号：US11414442
申请日：2006-04-29
申请人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F7/00
CPC分类号： G06F17/30705 , G06K9/6218
摘要： An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.
摘要翻译：提供了一种用于顺序数据集进化聚类的改进的系统和方法。可以确定用于表示所使用的特定聚类方法的数据集的快照成本，并且可以独立于序列中的数据集的一系列聚类来确定数据集的聚类成本。还可以确定历史成本用于测量数据集的相应簇之间的距离和数据集序列中的先前数据集之间的距离，以确定数据集的聚类成本，作为数据集的一系列聚类的一部分序列。可以通过最小化快照成本和历史成本的组合来确定用于对数据集进行聚类的总体成本。可以使用任何聚类方法，包括平面聚类和层次聚类。

38. 发明申请

US20070203924A1 Method and system for generating threads of documents 失效
标题翻译：用于生成文档线程的方法和系统
公开(公告)号：US20070203924A1
公开(公告)日：2007-08-30
申请号：US11364038
申请日：2006-02-28
申请人： Ramanathan Guha , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Ramanathan Guha , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F7/00
CPC分类号： G06F17/30958 , G06F17/30716 , Y10S707/99937 , Y10S707/99943
摘要： A method and system for generating threads of documents from a collection C of documents containing terms. Each document of C has a timestamp and an associated timestamp index. The timestamp indexes are ordered in accordance with an ordering of the associated timestamps. A relevance graph G generated from C is an acyclic directed graph. Each node of G denotes a document of C. Each edge of G connects a pair of directed nodes pointing from a node having an earlier timestamp to a node having a later timestamp. At least one thread of G is determined by executing a matching-based algorithm or a dynamic programming algorithm. Each thread is a path through G originating at a first node and terminating at a second node and including one or more contiguous edges from the first node to the second node. The at least one thread is outputted.
摘要翻译：一种用于从包含术语的文档的集合C生成文档的线程的方法和系统。 C的每个文档都具有时间戳和关联的时间戳索引。时间戳索引根据相关联的时间戳的顺序进行排序。从C生成的相关性图G是非循环有向图。 G的每个节点表示C的文档.G的每个边缘将指向具有较早时间戳的节点的一对定向节点连接到具有稍后时间戳的节点。通过执行基于匹配的算法或动态规划算法来确定G的至少一个线程。每个线程是通过起始于第一节点并且终止于第二节点并且包括从第一节点到第二节点的一个或多个相邻边缘的G的路径。输出至少一个线程。

39. 发明授权

US07222362B1 Non-transferable anonymous credentials 有权
标题翻译：不可转让的匿名凭证
公开(公告)号：US07222362B1
公开(公告)日：2007-05-22
申请号：US09571602
申请日：2000-05-15
申请人： Ran Canetti , Moses Samson Charikar , Sridhar Rajagopalan , Shanmugasundaram Ravikumar , Amit Sahai , Andrew S. Tomkins
发明人： Ran Canetti , Moses Samson Charikar , Sridhar Rajagopalan , Shanmugasundaram Ravikumar , Amit Sahai , Andrew S. Tomkins
IPC分类号： G06F7/04
CPC分类号： H04L9/3218 , H04L9/0869 , H04L9/3013 , H04L2209/42 , H04L2209/56
摘要： An anonymous credential system which requires a user who is asserting a credential to have knowledge of the master key of the user who was originally granted that credential. In order for a user to transfer the ability to assert any one of their credentials to another user, they must also transfer their master key to that same user. The master key, however, provides such unlimited rights to its holder that a user is strongly motivated not to share their master key with anyone else. In this manner, anonymous credentials become non-transferrable because a user cannot transfer a credential without transferring their entire electronic identity.
摘要翻译：一个匿名凭证系统，它需要一个正在断言凭证的用户知道最初被授予该凭证的用户的主密钥。为了使用户能够将其任何一个证书的身份传递给另一个用户，他们还必须将其主密钥传送给该用户。然而，主密钥为其持有者提供了无限权限，即用户有强烈的动机，不与任何其他人共享其主密钥。以这种方式，匿名凭证变得不可转让，因为用户不能传输凭证而不转移其整个电子身份。

40. 发明申请

US20060282411A1 System and method for performing a high-level multi-dimensional query on a multi-structural database 失效
公开(公告)号：US20060282411A1
公开(公告)日：2006-12-14
申请号：US11151056
申请日：2005-06-13
申请人： Ronald Fagin , Ramanathan Guha , Phokion Kolaitis , Jasmine Novak , Shanmugasundaram Ravikumar , Dandapani Sivakumar , Andrew Tomkins
发明人： Ronald Fagin , Ramanathan Guha , Phokion Kolaitis , Jasmine Novak , Shanmugasundaram Ravikumar , Dandapani Sivakumar , Andrew Tomkins
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , Y10S707/99933
摘要： A multi-structural query system performs a high-level multi-dimensional query on a multi-structural database. The query system enables a user to navigate a search by adding restrictions incrementally. The query system uses a schema to discover structure in a multi-structural database. The query system leaves a choice of nodes to return in response to a query as a constrained set of choices available to the algorithm. The query system further casts the selection of a set of nodes as an optimization. The query system uses pairwise-disjoint collections to capture a concise set of highlights of a data set within the allowed schema. The query system further comprises efficient algorithms that yield approximately optimal solutions for several classes of objective functions.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式