148 search results - page 22 / 30 » Evaluation of Queries on Tree-Structured Data Using Dimensio... |
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...