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

1. 发明申请

US20150178399A1 DATA STORAGE WITH LOCK-FREE STATELESS PAGING CAPABILITY 审中-公开
标题翻译：数据存储具有无锁定无缝封装能力
公开(公告)号：US20150178399A1
公开(公告)日：2015-06-25
申请号：US14639009
申请日：2015-03-04
申请人： W. Daniel HILLIS , Eric BAX , Augusto CALLEJAS , Harry KAO , Mathias L. KOLEHMAINEN
发明人： W. Daniel HILLIS , Eric BAX , Augusto CALLEJAS , Harry KAO , Mathias L. KOLEHMAINEN
IPC分类号： G06F17/30
摘要： Disclosed are a method and apparatus for limiting the number of results returned by a store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.
摘要翻译：公开了一种用于限制响应于查询的商店返回的结果的数量的方法和装置。在接收到初始查询之后，数据存储返回包含符合查询条件的数据存储库内数据项子集的结果页。数据存储还提供指示数据项集的范围的标记。如果接收到请求满足相同查询条件并且包括标记的附加结果的后续查询，则数据存储返回包括与初始子集不相交的数据项的子集的结果页面，并提供更新的标记这表明初始和后续子集的联合程度。如果从数据存储还需要进一步的结果，则可以提交包含更新的标记的附加查询。

2. 发明申请

US20060129540A1 Data store with lock-free stateless paging capability 有权
公开(公告)号：US20060129540A1
公开(公告)日：2006-06-15
申请号：US11301985
申请日：2005-12-12
申请人： W. Hillis , Eric Bax , Augusto Callejas , Harry Kao , Mathias Kolehmainen
发明人： W. Hillis , Eric Bax , Augusto Callejas , Harry Kao , Mathias Kolehmainen
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/3053 , G06F17/30545 , G06F17/30592 , G06F17/30876
摘要： Disclosed are a method and apparatus for limiting the number of results returned by a data store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.

3. 发明授权

US08996486B2 Data store with lock-free stateless paging capability 有权
标题翻译：数据存储，无锁无状态寻呼功能
公开(公告)号：US08996486B2
公开(公告)日：2015-03-31
申请号：US11301985
申请日：2005-12-12
申请人： W. Daniel Hillis , Eric Bax , Augusto Callejas , Harry Kao , Mathias L. Kolehmainen
发明人： W. Daniel Hillis , Eric Bax , Augusto Callejas , Harry Kao , Mathias L. Kolehmainen
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30867 , G06F17/3053 , G06F17/30545 , G06F17/30592 , G06F17/30876
摘要： Disclosed are a method and apparatus for limiting the number of results returned by a data store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.
摘要翻译：公开了一种用于限制响应于查询的数据存储返回的结果的数量的方法和装置。在接收到初始查询之后，数据存储返回包含符合查询条件的数据存储库内数据项子集的结果页。数据存储还提供指示数据项集的范围的标记。如果接收到请求满足相同查询条件并且包括标记的附加结果的后续查询，则数据存储返回包括与初始子集不相交的数据项的子集的结果页面，并提供更新的标记这表明初始和后续子集的联合程度。如果从数据存储还需要进一步的结果，则可以提交包含更新的标记的附加查询。

4. 发明申请

US20090204559A1 Bounding error rate based on a worst likely assignment 失效
标题翻译：基于最差可能分配的边界错误率
公开(公告)号：US20090204559A1
公开(公告)日：2009-08-13
申请号：US12069129
申请日：2008-02-07
申请人： Eric Bax , Augusto Callejas
发明人： Eric Bax , Augusto Callejas
IPC分类号： G06F15/18 , G06F11/07
CPC分类号： G06N99/005 , G06K9/6268
摘要： Given a set of training examples—with known inputs and outputs—and a set of working examples—with known inputs but unknown outputs—train a classifier on the training examples. For each possible assignment of outputs to the working examples, determine whether assigning the outputs to the working examples results in a training and working set that are likely to have resulted from the same distribution. If so, then add the assignment to a likely set of assignments. For each assignment in the likely set, compute the error of the trained classifier on the assignment. Use the maximum of these errors as a probably approximately correct error bound for the classifier.
摘要翻译：给出一组具有已知输入和输出的培训示例 - 以及一组工作示例 - 具有已知输入但未知输出 - 训练培训示例上的分类器。对于工作示例的输出的每个可能的分配，确定将输出分配给工作示例是否导致可能由相同分发产生的培训和工作集。如果是，则将赋值分配给可能的一组分配。对于可能的集合中的每个分配，计算分配上训练分类器的错误。将这些错误的最大值用作分类器的大概近似正确的误差界限。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式