Sciweavers

11213 search results - page 221 / 2243
» Low-contention data structures
Sort
View
DAGSTUHL
1998
15 years 6 months ago
Segmented Iterators and Hierarchical Algorithms
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...
Matthew H. Austern
137
Voted
JMLR
2002
90views more  JMLR 2002»
15 years 5 months ago
Machine Learning with Data Dependent Hypothesis Classes
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...
Adam Cannon, J. Mark Ettinger, Don R. Hush, Clint ...
SIGMOD
2008
ACM
97views Database» more  SIGMOD 2008»
15 years 4 months ago
Exploring ocean data
In fall of 2004, we met Jim Gray and began to converse about the data needs of ocean scientists. The conversations ultimately led to the development of a unique portal for explori...
James G. Bellingham, Mike Godin
SEMWEB
2010
Springer
15 years 3 months ago
Summary Models for Routing Keywords to Linked Data Sources
The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of d...
Thanh Tran, Lei Zhang, Rudi Studer
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 2 months ago
Ontology-based Queries over Cancer Data
The ever-increasing amount of data in biomedical research, and in cancer research in particular, needs to be managed to support efficient data access, exchange and integration. Exi...
Alejandra González Beltrán, Ben Tagg...