3223 search results - page 380 / 645 » The Scaling of Search Cost |
197
click to vote
SEBD
1997
15 years 8 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
188
click to vote
AIPS
1994
15 years 8 months ago
1994
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
184
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
In order to be adopted within corporate environments, Semantic Web applications must provide tangible short-/medium-term gains. Although corporate Semantic Web offers enterprises n...
176
click to vote
DATAMINE
2008
15 years 6 months ago
2008
Rules are commonly used for classification because they are modular, intelligible and easy to learn. Existing work in classification rule learning assumes the goal is to produce ca...
154
click to vote
DKE
2008
15 years 6 months ago
2008
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...