172 search results - page 18 / 35 » The Complexity of Unions of Disjoint Sets |
IS
2008
13 years 7 months ago
2008
In this paper, we formalize the digital library (DL) integration problem and propose an overall approach based on the 5S (streams, structures, spaces, scenarios, and societies) fr...
ICAISC
2010
Springer
14 years 15 days ago
2010
Springer
This paper presents a new implementation of the co-VAT algorithm. We assume we have an m × n matrix D, where the elements of D are pair-wise dissimilarities between m row objects ...
CCCG
2007
13 years 9 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
SIGITE
2004
ACM
14 years 1 months ago
2004
ACM
There are efforts underway to define each of several flavors of computing disciplines, including computer science, computer engineering, information science, information technolog...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...