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

1. 发明授权

US07082473B2 System and method for optimizing open shortest path first aggregates and autonomous network domain incorporating the same 有权
公开(公告)号：US07082473B2
公开(公告)日：2006-07-25
申请号：US09775329
申请日：2001-02-01
申请人： Yuri J. Breitbart , Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi
发明人： Yuri J. Breitbart , Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi
IPC分类号： G06F15/173 , H04L12/28
CPC分类号： H04L45/12 , H04L45/04 , H04L45/123 , H04L45/124 , H04L45/46
摘要： Systems and method for selecting open shortest path first (OSPF) aggregates and aggregate weights for a particular area. In one embodiment, an aggregate selecting system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and corresponding weights and (2) an aggregate selector, associated with the database, that selects at least a subset of the OSPF aggregates such that the shortest path length between the particular source and destination subnets resulting from advertisement of a set of weighted aggregates approaches the shortest path length between the particular source and destination subnets irrespective of the advertisement. In one embodiment, a weight selection system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and (2) a weight assigner, associated with the database, that assigns, for the OSPF aggregates, weights based on either an average distance of subnets in the area for a particular area border router (ABR) of the area or a search heuristic.

2. 发明授权

US07668856B2 Method for distinct count estimation over joins of continuous update stream 有权
标题翻译：连续更新流连接的不同计数估计方法
公开(公告)号：US07668856B2
公开(公告)日：2010-02-23
申请号：US10957185
申请日：2004-09-30
申请人： Sumit Ganguly , Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi
发明人： Sumit Ganguly , Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi
IPC分类号： G06F7/00
CPC分类号： G06F17/30498 , G11C16/0416 , Y10S707/99943
摘要： The invention provides methods and systems for summarizing multiple continuous update streams such that an approximate answer to a query over one or more of the continuous update streams (such as a Query requiring a join operation followed by a duplicate elimination step) may be rapidly provided. The systems and methods use multiple (parallel) Join Distinct (JD) Sketch data structures corresponding to hash buckets of at least one initial attribute.
摘要翻译：本发明提供了用于总结多个连续更新流的方法和系统，使得可以快速地提供对连续更新流中的一个或多个（诸如需要连接操作后跟重复消除步骤的查询）的查询的近似答案。系统和方法使用与至少一个初始属性的哈希桶对应的多个（并行）联合特征（JD）草图数据结构。

3. 发明申请

US20100115350A1 DETERMINISTIC WAVELET THRESHOLDING FOR GENERAL-ERROR METRICS 有权
标题翻译：用于一般错误度量的确定性小波变换
公开(公告)号：US20100115350A1
公开(公告)日：2010-05-06
申请号：US12605795
申请日：2009-10-26
申请人： Minos N. Garofalakis , Amit Kumar
发明人： Minos N. Garofalakis , Amit Kumar
IPC分类号： G06F11/00
CPC分类号： G06F17/148
摘要： Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.
摘要翻译：提供了用于确定性小波阈值的计算有效方案，其目的是优化最大误差度量。提供了一种基于新动态规划（DP）公式的一维小波阈值优化的最优低次多项式时间算法，可用于最小化数据重构中的最大相对误差或绝对误差。将一维DP算法直接扩展为多维小波导致数据维度在时间复杂度方面的超指数增长。因此，还提供了用于确定性小波阈值在多个维度中的新颖多项式时间近似方案（对于目标最大误差度量具有可调近似保证）。

4. 发明授权

US08055088B2 Deterministic wavelet thresholding for general-error metrics 有权
标题翻译：一般误差度量的确定性小波阈值
公开(公告)号：US08055088B2
公开(公告)日：2011-11-08
申请号：US12605795
申请日：2009-10-26
申请人： Minos N. Garofalakis , Amit Kumar
发明人： Minos N. Garofalakis , Amit Kumar
IPC分类号： G06K9/00
CPC分类号： G06F17/148
摘要： Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.
摘要翻译：提供了用于确定性小波阈值的计算有效方案，其目的是优化最大误差度量。提供了一种基于新动态规划（DP）公式的一维小波阈值优化的最优低次多项式时间算法，可用于最小化数据重构中的最大相对误差或绝对误差。将一维DP算法直接扩展为多维小波导致数据维度在时间复杂度方面的超指数增长。因此，还提供了用于确定性小波阈值在多个维度中的新颖多项式时间近似方案（对于目标最大误差度量具有可调近似保证）。

5. 发明授权

US07693335B2 Deterministic wavelet thresholding for general-error metrics 有权
标题翻译：一般误差度量的确定性小波阈值
公开(公告)号：US07693335B2
公开(公告)日：2010-04-06
申请号：US11152842
申请日：2005-06-13
申请人： Minos N. Garofalakis , Amit Kumar
发明人： Minos N. Garofalakis , Amit Kumar
IPC分类号： G06K9/46
CPC分类号： G06F17/148
摘要： Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.
摘要翻译：提供了用于确定性小波阈值的计算有效方案，其目的是优化最大误差度量。提供了一种基于新动态规划（DP）公式的一维小波阈值优化的最优低次多项式时间算法，可用于最小化数据重构中的最大相对误差或绝对误差。将一维DP算法直接扩展为多维小波导致数据维度在时间复杂度方面的超指数增长。因此，还提供了用于确定性小波阈值在多个维度中的新颖多项式时间近似方案（对于目标最大误差度量具有可调近似保证）。

6. 发明申请

US20060085592A1 Method for distinct count estimation over joins of continuous update stream 有权
标题翻译：连续更新流连接的不同计数估计方法
公开(公告)号：US20060085592A1
公开(公告)日：2006-04-20
申请号：US10957185
申请日：2004-09-30
申请人： Sumit Ganguly , Minos Garofalakis , Amit Kumar , Rajeev Rastogi
发明人： Sumit Ganguly , Minos Garofalakis , Amit Kumar , Rajeev Rastogi
IPC分类号： G06F12/14
CPC分类号： G06F17/30498 , G11C16/0416 , Y10S707/99943
摘要： The invention provides methods and systems for summarizing multiple continuous update streams using corresponding multiple (parallel) JD Sketch data structures such that, for example, an approximate answer to a query requiring a join operation followed by a duplicate elimination step may be rapidly provided.
摘要翻译：本发明提供了使用对应的多个（并行）JD Sketch数据结构来概括多个连续更新流的方法和系统，使得例如可以快速地提供需要连接操作的跟踪操作的近似答案。

7. 发明授权

US07542470B2 Method and apparatus for routing a packet within a plurality of nodes arranged in a line or a tree given a maximum stack depth 有权
标题翻译：用于路由布置在具有最大堆栈深度的一行或一棵树中的多个节点内的分组的方法和装置
公开(公告)号：US07542470B2
公开(公告)日：2009-06-02
申请号：US10404010
申请日：2003-03-31
申请人： Anupam Gupta , Amit Kumar , Rajeev Rastogi
发明人： Anupam Gupta , Amit Kumar , Rajeev Rastogi
IPC分类号： H04L12/56
CPC分类号： H04L45/50 , H04L45/10 , H04L45/48
摘要： A method and apparatus are provided for routing a packet within a plurality of n nodes arranged in a line or tree (or a combination of the foregoing), given a maximum stack depth, s. A fixed stack process for routing packets on a line given a stack depth, s, initially divides a line of n nodes into segments, such as n1/s approximately equal segments. A unique label is assigned to each segment and, within each segment, one of up to n1/s labels is assigned to each node. A fixed stack process for routing packets on a tree, given a target stack depth, s, initially identifies a subset, S, of at nodes from the tree, such as at most 3 n1/s nodes, such that after the subset, S, is removed, each remaining subtree has at most n(s-1)/s nodes. A unique label is assigned to each of the nodes in the subset S and, within each remaining subtree, one of up to n(s-1)/s labels is assigned to each node. If the bound on the stack depth cannot be violated, the fixed stack routing process merges every two consecutive levels in the stack to one level.
摘要翻译：提供了一种方法和装置，用于在给定最大堆栈深度s的情况下路由布置在线或树（或前述的组合）中的多个n个节点内的分组。给定堆栈深度s的线路上的路由数据包的固定堆栈过程最初将n个节点的一行划分成段，如n1 / s大致相等的段。每个段分配唯一的标签，在每个段内，每个节点分配了多达n1 / s个标签之一。给定目标堆栈深度s的用于在树上路由数据包的固定堆栈过程最初识别来自树的节点（例如最多3个n1 / s个节点）的子集S，使得在该子集之后，S 被删除，每个剩余的子树最多具有n（s-1）/ s个节点。分配给子集S中的每个节点的唯一标签，并且在每个剩余子树中，每个节点分配多达n（s-1）/ s个标签之一。如果不能违反堆栈深度的限制，则固定堆栈路由进程将堆栈中的每两个连续级别合并到一个级别。

8. 发明申请

US20210224844A1 MEASURING CONVERSION OF AN ONLINE ADVERTISING CAMPAIGN INCLUDING REFERRAL OFFERS FROM AN OFFLINE MERCHANT 有权
公开(公告)号：US20210224844A1
公开(公告)日：2021-07-22
申请号：US17012271
申请日：2020-09-04
申请人： Jeffrey WINNER , Geraud Boyer , Amit Kumar , Eckart Walther
发明人： Jeffrey WINNER , Geraud Boyer , Amit Kumar , Eckart Walther
IPC分类号： G06Q30/02
摘要： A technique for determining the effectiveness of an offer includes analyzing views, clicks, acceptances and satisfactions of the offer. Transaction data is retrieved to determine whether criteria of the offer has been satisfied. As a result, a total cost per transaction may be determined for an advertisement campaign that incorporates the offer. Further, detailed queries may be issued to identify areas in which the offer needs improvement.

9. 发明授权

US10495769B2 System and method for reservoir simulation using on-demand data 有权
公开(公告)号：US10495769B2
公开(公告)日：2019-12-03
申请号：US14395426
申请日：2012-04-30
申请人： Amit Kumar , Priyesh Ranjan
发明人： Amit Kumar , Priyesh Ranjan
IPC分类号： G01V1/30
CPC分类号： G01V1/30 , G01V2210/66 , G01V2210/72
摘要： A method of modeling a formation is described. In one aspect of the disclosure, the method includes initiating operation of a reservoir simulator, and, following initiation of operation of the simulator, retrieving formation data from an external data source via a communications network and utilizing the retrieved data as part of the on-going simulation. In certain embodiments, a data deck may be supplied to the simulator before operation of the simulator is initiated. The data deck may include information for establishing a network communications link between the reservoir simulator and an external data server.

10. 发明授权

US10120936B2 Providing system configuration information to a search engine 有权
公开(公告)号：US10120936B2
公开(公告)日：2018-11-06
申请号：US11642177
申请日：2006-12-19
申请人： Amit Kumar
发明人： Amit Kumar
IPC分类号： G06F15/173 , G06F17/30 , H04L29/08
摘要： Providing a search engine with system configuration information. The system configuration information pertains to a system having a web server that provides content. For example, the content may be web pages associated with a web site, and the system may include hardware and software used to provide the content of the web site to end users. More particularly, the system can include one or more computer systems, web server software, application server software, and application programs that facilitate providing content. A search engine requests system configuration information from the web server. In response to the request, the web server provides system configuration information to the search engine. The search engine can use the system configuration information to reference portions of the content in an index. The index can be used to respond to a search query that involves content served by the web server.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式