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

1. 发明申请

US20090112846A1 SYSTEM AND/OR METHOD FOR PROCESSING EVENTS 有权
标题翻译：用于处理事件的系统和/或方法
公开(公告)号：US20090112846A1
公开(公告)日：2009-04-30
申请号：US11932928
申请日：2007-10-31
申请人： Erik N. Vee , Minos Garofalakis , Jayavel Shanmugasundaram , Ashwin Kumar V. Machanavajjhala
发明人： Erik N. Vee , Minos Garofalakis , Jayavel Shanmugasundaram , Ashwin Kumar V. Machanavajjhala
IPC分类号： G06F17/30
CPC分类号： G06F17/30533
摘要： The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree.
摘要翻译：本文公开的主题涉及处理关于事件的信息。在一个特定示例中，可以响应于事件来制定刺戳查询。一个或多个集合与树的节点相关联和/或映射到树的节点。

2. 发明授权

US07890494B2 System and/or method for processing events 有权
标题翻译：用于处理事件的系统和/或方法
公开(公告)号：US07890494B2
公开(公告)日：2011-02-15
申请号：US11932928
申请日：2007-10-31
申请人： Erik N. Vee , Minos Garofalakis , Jayavel Shanmugasundaram , Ashwin Kumar V Machanavajjhala
发明人： Erik N. Vee , Minos Garofalakis , Jayavel Shanmugasundaram , Ashwin Kumar V Machanavajjhala
IPC分类号： G06F17/30
CPC分类号： G06F17/30533
摘要： The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree.
摘要翻译：本文公开的主题涉及处理关于事件的信息。在一个特定示例中，可以响应于事件来制定刺戳查询。一个或多个集合与树的节点相关联和/或映射到树的节点。

3. 发明申请

US20100082428A1 DISPLAY ADVERTISING INVENTORY ESTIMATION 审中-公开
标题翻译：显示广告库存估计
公开(公告)号：US20100082428A1
公开(公告)日：2010-04-01
申请号：US12242709
申请日：2008-09-30
申请人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , Srinivasan Rajagopal , Minos Garofalakis , Erik N. Vee , Ramana Yerneni
发明人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , Srinivasan Rajagopal , Minos Garofalakis , Erik N. Vee , Ramana Yerneni
IPC分类号： G06Q30/00 , G06Q10/00 , G06Q20/00
CPC分类号： G06Q10/087 , G06Q30/02 , G06Q30/0251 , G06Q30/0261 , G06Q30/0283
摘要： Example embodiments described herein may relate to estimating inventory for a display advertising system utilized, for example, in Web-based advertising.
摘要翻译：本文描述的示例性实施例可以涉及估计例如在基于Web的广告中使用的显示广告系统的库存。

4. 发明申请

US20090204703A1 AUTOMATED DOCUMENT CLASSIFIER TUNING 有权
标题翻译：自动文件分类器调谐
公开(公告)号：US20090204703A1
公开(公告)日：2009-08-13
申请号：US12029040
申请日：2008-02-11
申请人： Minos Garofalakis , Jayavel Shanmugasundaram , Erik Nathan Vee , Rajagopal Baskaran , Jagadish P. Samantarai , Chyr-Chong Joseph Ting , Yuan Zhuge
发明人： Minos Garofalakis , Jayavel Shanmugasundaram , Erik Nathan Vee , Rajagopal Baskaran , Jagadish P. Samantarai , Chyr-Chong Joseph Ting , Yuan Zhuge
IPC分类号： G06F15/173
CPC分类号： G06Q10/00
摘要： Subject matter disclosed herein relates to document classification and/or automated document classifier tuning.
摘要翻译：本文公开的主题涉及文档分类和/或自动文档分类器调谐。

5. 发明申请

US20100185515A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100185515A1
公开(公告)日：2010-07-22
申请号：US12355282
申请日：2009-01-16
申请人： Ramana Yerneni , Erik Vee , Minos Garofalakis , Srinivasan Rajagopal , Jayavel Shanmugasundaram , Mark Sordo , Donald Swanson , Sergei Vassilvitskii
发明人： Ramana Yerneni , Erik Vee , Minos Garofalakis , Srinivasan Rajagopal , Jayavel Shanmugasundaram , Mark Sordo , Donald Swanson , Sergei Vassilvitskii
IPC分类号： G06Q30/00 , G06Q10/00 , G06Q90/00
CPC分类号： G06Q30/02 , G06Q10/087 , G06Q30/0261 , G06Q30/0269
摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating an inventory pool that represents a number of impressions deliverable to all users, then determining, from multiple past orders for booking impressions, a hierarchy of parameters utilized to target users and a number of impressions deliverable to users characterized by the parameters. The inventory pool may then be partitioned into multiple inventory pools according to the hierarchy, where each inventory pool represents a number of impressions deliverable to users characterized by parameters associated with the inventory pool. The hierarchy of pools may then be stored to a database.
摘要翻译：提供了一种用于在因特网环境中分配库存的方法和系统。系统使用的方法可以包括生成表示可向所有用户递送的展示次数的库存池，然后从多个过去的订单中确定用于预定展示的用于定向用户的参数层级以及可递送给用户的多个展示次数其特征在于参数。然后可以根据层次结构将库存池划分为多个库存池，其中每个库存池代表可由可用于与库存池相关联的参数表征的用户可交付的一些展示次数。然后可以将池的层次结构存储到数据库。

6. 发明申请

US20100036865A1 Method For Generating Score-Optimal R-Trees 审中-公开
标题翻译：生成分数最优R树的方法
公开(公告)号：US20100036865A1
公开(公告)日：2010-02-11
申请号：US12188169
申请日：2008-08-07
申请人： Jayavel SHANMUGASUNDARAM , Minos Garofalakis , Erik Vee , Ashwin Kumar Machanavajjhala
发明人： Jayavel SHANMUGASUNDARAM , Minos Garofalakis , Erik Vee , Ashwin Kumar Machanavajjhala
IPC分类号： G06F17/30
CPC分类号： G06F16/322
摘要： A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph.
摘要翻译：一种构建分数最优R树以支持一组计分间隔的顶部k个刺激查询的方法从该集合生成约束图，并确定约束图中没有其他节点指向它的每个节点具有最小左端点的节点; 对于这些节点中的每一个，将相关联的间隔添加到树中，并且从约束图中移除该节点。

7. 发明授权

US07797260B2 Automated document classifier tuning including training set adaptive to user browsing behavior 有权
标题翻译：自动文档分类器调整，包括适应用户浏览行为的训练集
公开(公告)号：US07797260B2
公开(公告)日：2010-09-14
申请号：US12029040
申请日：2008-02-11
申请人： Minos Garofalakis , Jayavel Shanmugasundaram , Erik Nathan Vee , Rajagopal Baskaran , Jagadish P. Samantarai , Chyr-Chong (Joseph) Ting , Yuan Zhuge
发明人： Minos Garofalakis , Jayavel Shanmugasundaram , Erik Nathan Vee , Rajagopal Baskaran , Jagadish P. Samantarai , Chyr-Chong (Joseph) Ting , Yuan Zhuge
IPC分类号： G06F15/18
CPC分类号： G06Q10/00
摘要： Subject matter disclosed herein relates to document classification and/or automated document classifier tuning. In an example embodiment, a document received from a user computing platform in an online database stored in a memory of a server computing platform may be classified based, at least in part, on a training set. Also for an example embodiment, the training set may be modified based, at least in part, on statistics gathered from user browsing behavior.
摘要翻译：本文公开的主题涉及文档分类和/或自动文档分类器调谐。在示例实施例中，可以至少部分地基于训练集来分类从存储在服务器计算平台的存储器中的在线数据库中的用户计算平台接收到的文档。同样对于示例性实施例，训练集可以至少部分地基于从用户浏览行为收集的统计数据进行修改。

8. 发明授权

US08145669B2 Methods and apparatus for representing probabilistic data using a probabilistic histogram 失效
标题翻译：使用概率直方图表示概率数据的方法和装置
公开(公告)号：US08145669B2
公开(公告)日：2012-03-27
申请号：US12636544
申请日：2009-12-11
申请人： Graham Cormode , Antonios Deligiannakis , Minos Garofalakis , Andrew Iain Shaw McGregor
发明人： Graham Cormode , Antonios Deligiannakis , Minos Garofalakis , Andrew Iain Shaw McGregor
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30536
摘要： Methods and apparatus for representing probabilistic data using a probabilistic histogram are disclosed. An example method comprises partitioning a plurality of ordered data items into a plurality of buckets, each of the data items capable of having a data value from a plurality of possible data values with a probability characterized by a respective individual probability distribution function (PDF), each bucket associated with a respective subset of the ordered data items bounded by a respective beginning data item and a respective ending data item, and determining a first representative PDF for a first bucket associated with a first subset of the ordered data items by partitioning the plurality of possible data values into a first plurality of representative data ranges and respective representative probabilities based on an error between the first representative PDF and a first plurality of individual PDFs characterizing the first subset of the ordered data items.
摘要翻译：公开了使用概率直方图表示概率数据的方法和装置。一种示例性方法包括将多个有序数据项划分成多个桶，每个数据项能够具有来自多个可能数据值的数据值，其特征在于各自的概率分布函数（PDF），每个桶与由相应的开始数据项和相应的结束数据项限定的有序数据项的相应子集相关联，并且通过分割多个数据项来确定与有序数据项的第一子集相关联的第一个桶的第一代表性PDF 基于第一代表性PDF和表征有序数据项的第一子集的第一多个单独PDF之间的误差，将可能的数据值转换成第一多个代表性数据范围和相应的代表概率。

9. 发明授权

US07669241B2 Streaming algorithms for robust, real-time detection of DDoS attacks 有权
标题翻译：用于强大，实时检测DDoS攻击的流式算法
公开(公告)号：US07669241B2
公开(公告)日：2010-02-23
申请号：US10954901
申请日：2004-09-30
申请人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi , Krishan Sabnani
发明人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi , Krishan Sabnani
IPC分类号： G06F12/14
CPC分类号： H04L29/06027 , H04L63/1458 , H04L65/607
摘要： A distinct-count estimate is obtained in a guaranteed small footprint using a two level hash, distinct count sketch. A first hash fills the first-level hash buckets with an exponentially decreasing number of data-elements. These are then uniformly hashed to an array of second-level-hash tables, and have an associated total-element counter and bit-location counters. These counters are used to identify singletons and so provide a distinct-sample and a distinct-count. An estimate of the total distinct-count is obtained by dividing by the distinct-count by the probability of mapping a data-element to that bucket. An estimate of the total distinct-source frequencies of destination address can be found in a similar fashion. By further associating the distinct-count sketch with a list of singletons, a total singleton count and a heap containing the destination addresses ordered by their distinct-source frequencies, a tracking distinct-count sketch may be formed that has considerably improved query time.
摘要翻译：使用两级散列，不同的计数草图在保证的小尺寸中获得不同的计数估计。第一个散列填充了数据元素数量级数下降的第一级哈希桶。然后将它们均匀地散列到二级哈希表的阵列，并具有关联的全元计数器和位位计数器。这些计数器用于识别单例，因此提供了不同的样本和不同的数字。通过将distinct-count除以将数据元素映射到该存储桶的概率，可以获得总区分计数的估计。可以以类似的方式找到目的地地址的不同源频率的总体估计。通过进一步将不同数量的草图与单例列表相关联，总共单例数和包含由其不同源频率排序的目的地地址的堆，可以形成具有显着改进的查询时间的跟踪不同计划草图。

10. 发明授权

US07596544B2 Tracking set-expression cardinalities over continuous update streams 有权
标题翻译：跟踪连续更新流中的设置表达式基数
公开(公告)号：US07596544B2
公开(公告)日：2009-09-29
申请号：US11025355
申请日：2004-12-29
申请人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
发明人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
IPC分类号： G06F7/00
CPC分类号： G06F17/30469 , Y10S707/99932
摘要： A method of estimating set-expression cardinalities over data streams with guaranteed small maintenance time per data-element update. The method only examines each data element once and uses a limited amount of memory. The time-efficient stream synopsis extends 2-level hash-sketches by randomly, but uniformly, pre-hashing data-elements prior to logarithmically hashing them to a first-level hash-table. This generates a set of independent 2-level hash-sketches. The set-union cardinality can be estimated by determining the smallest hash-bucket index j at which only a predetermined fraction of the b hash-buckets has a non-empty union |A∪B|. Once a set-union cardinality is estimated, general set-expression cardinalities may be estimated by counting witness elements for the set-expression, i.e., those first-level hash-buckets that are both a singleton for the set-expression and a set-union singleton. The set-expression cardinality is the set-union cardinality times the number of witness elements divided by the number of hash-buckets.
摘要翻译：一种估计数据流上的设置表达式基数的方法，每个数据元素更新保证小的维护时间。该方法仅检查每个数据元素一次并使用有限的内存。时间有效的流摘要通过随机，但统一地将数据元素进行对数散列之前的第一级散列表来扩展二级散列草图。这产生一组独立的2级散列草图。可以通过确定最小的哈希桶索引j来估计设置联合的基数，其中只有预定的b个哈希桶的一部分具有非空联合|A∪B|。一旦估计了一个组合基数，就可以通过对集表达式的见证元素进行计数来估计一般的集合表示基数，即那些既是集合表达式的单例的一级哈希数据包，联合单身人士 set-expression的基数是set-union的基数乘以证人的数量除以哈希桶的数量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式