278 search results - page 12 / 56 » Two Upper Bounds on the Chromatic Number |
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
COMGEO
2011
ACM
13 years 3 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
SSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper considers message-driven self-stabilizing implementations of unreliable failure detectors. We show that it is impossible to give a deterministic implementation...
EUROCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...