4541 search results - page 101 / 909 » Cache-Oblivious Algorithms and Data Structures |
CC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
UAI
2000
15 years 16 days ago
2000
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...
109
click to vote
ICML
1995
IEEE
16 years 16 hour ago
1995
IEEE
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...
108
click to vote
EDBTW
2010
Springer
15 years 5 months ago
2010
Springer
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...
100
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
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 ...