278 search results - page 16 / 56 » Two Upper Bounds on the Chromatic Number |
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
JCSS
2002
13 years 8 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
SWAT
2010
Springer
14 years 1 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...