128 search results - page 2 / 26 » Partitioning a weighted partial order |
DAM
2007
13 years 5 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...
CPC
2006
13 years 5 months ago
2006
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
DM
2006
13 years 5 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
ICPR
2008
IEEE
13 years 12 months ago
2008
IEEE
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...