4913 search results - page 34 / 983 » Results and Perspectives of the G |
HICSS
2003
IEEE
14 years 2 months ago
2003
IEEE
More than a process-automating tool, telemedicine is increasingly recognized for its ability to facilitate collaboration and knowledge creation between disparate healthcare provid...
ECCC
2006
13 years 9 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
DGO
2011
12 years 8 months ago
2011
We consider open government (OG) within the context of egovernment and its broader implications for the future of public administration. We argue that the current US Administratio...
JCT
2008
13 years 9 months 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...
IPL
2007
13 years 9 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...