3757 search results - page 198 / 752 » The overlap number of a graph |
161
click to vote
SIROCCO
2007
15 years 8 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...
174
click to vote
DM
2008
15 years 6 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
179
click to vote
JGT
2006
15 years 6 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
264
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose a distributed XML stream filtering system that uses a large number of subscribers' profiles, written in XPath expressions, to filter XML streams and then publish t...
176
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
Previous discretization techniques have discretized numeric attributes into disjoint intervals. We argue that this is neither necessary nor appropriate for naive-Bayes classifiers...