819 search results - page 81 / 164 » Parallelization with Tree Skeletons |
100
click to vote
DOLAP
1998
ACM
15 years 4 months ago
1998
ACM
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
AI
2002
Springer
14 years 11 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
119
click to vote
EMNLP
2011
13 years 11 months ago
2011
When translating among languages that differ substantially in word order, machine translation (MT) systems benefit from syntactic preordering—an approach that uses features fro...
109
click to vote
SGAI
2009
Springer
15 years 6 months ago
2009
Springer
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...
107
click to vote
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...