973 search results - page 80 / 195 » New Bounds on Crossing Numbers |
ICDM
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract. We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speed-up with the number of computing nodes. The algorithm is the fi...
COMPGEOM
1991
ACM
15 years 3 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
SIROCCO
2007
15 years 1 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
100
click to vote
IANDC
2006
14 years 12 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
104
click to vote
CORR
2007
Springer
14 years 12 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...