1887 search results - page 15 / 378 » An efficient search algorithm for partially ordered sets |
DAM
2007
13 years 7 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
NAA
2000
Springer
13 years 11 months ago
2000
Springer
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...