172 search results - page 15 / 35 » The Complexity of Unions of Disjoint Sets |
127
click to vote
MICS
2007
15 years 5 months ago
2007
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
146
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
180
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
137
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
157
click to vote
ADC
2005
Springer
15 years 11 months ago
2005
Springer
With the advent of XML and its use as a database language, dependency and normal form theory has attracted novel research interest. Several approaches to build up a dependency and...