486 search results - page 69 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
HPCN
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We discuss the High Performance Fortran data parallel programming language as an aid to software engineering and as a tool for exploiting High Performance Computing syste...
KDD
1997
ACM
13 years 12 months ago
1997
ACM
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...
COCO
1997
Springer
13 years 12 months ago
1997
Springer
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
ALGORITHMICA
2000
13 years 7 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...