Sciweavers

3731 search results - page 95 / 747
» cases 2006
Sort
View
98
Voted
PUC
2000
70views more  PUC 2000»
15 years 11 days ago
Mobile Computers in a Community NHS Trust: Is this a Relevant Context and Environment for their Use?
This paper describes a case study in which mobile computers were used by a UK NHS Trust. The intention was to give clinicians access to up to date patient data enabling them to be...
Barbara McManus
82
Voted
RSA
2008
63views more  RSA 2008»
15 years 2 days ago
On the size of the algebraic difference of two random Cantor sets
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
Michel Dekking, Károly Simon
86
Voted
DCC
2006
IEEE
16 years 5 days ago
Self-Reciprocal Irreducible Pentanomials Over F2
Joseph Yucas and Gary Mullen conjectured that there is no self-reciprocal irreducible pentanomial of degree n over F2 if n is divisible by 6. In this note we prove this conjecture ...
Omran Ahmadi
104
Voted
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
15 years 4 months ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover
74
Voted
JGT
2006
40views more  JGT 2006»
15 years 17 days ago
How many graphs are unions of k-cliques?
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
Béla Bollobás, Graham Brightwell