945 search results - page 56 / 189 » Graph Types |
130
click to vote
WICON
2008
15 years 3 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
105
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
124
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
115
click to vote
IJCAI
2003
15 years 3 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
179
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...