499 search results - page 61 / 100 » On the Decay of Crossing Numbers |
JGT
2006
13 years 7 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...
MICCAI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In analyzing diffusion magnetic resonance imaging, multitensor models address the limitations of the single diffusion tensor in situations of partial voluming and fiber c...
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Coherent base station (BS) cooperative transmission provides high spectrum efficiency for cellular systems when channel state information (CSI) is perfectly known at the BSs. For...
FLAIRS
2004
13 years 9 months ago
2004
This study borrowed sequence analysis techniques from the genetic sciences and applied them to a similar problem in email filtering and web searching. Genre identification is the ...