Sciweavers

4536 search results - page 118 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
UAI
2000
13 years 10 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
DMIN
2010
262views Data Mining» more  DMIN 2010»
13 years 7 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...
ICML
1995
IEEE
14 years 10 months ago
Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...
Justine Blackmore, Risto Miikkulainen
EDBTW
2010
Springer
14 years 3 months ago
SPARQL query rewriting for implementing data integration over linked data
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
Gianluca Correndo, Manuel Salvadores, Ian Millard,...
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
14 years 9 months ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001