4983 search results - page 113 / 997 » order 2008 |
84
Voted
DM
2006
15 years 23 days ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
118
Voted
ISCI
2008
15 years 22 days ago
2008
In order to characterize the non-Gaussian information contained within the EEG signals, a new feature extraction method based on bispectrum is proposed and applied to the classifi...
106
Voted
JCT
2008
15 years 21 days ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
85
Voted
JGO
2008
15 years 21 days ago
2008
In this paper we use the tools of the convex analysis in order to give a suitable characterization for the epigraph of the conjugate of the pointwise maximum of two proper, convex ...
97
Voted
JUCS
2008
15 years 21 days ago
2008
: The design of the groupware systems is a progressively extended task, which is difficult to tackle. There are not proposals to support the joint modeling of collaborative and int...