17049 search results - page 85 / 3410 » cans 2007 |
APAL
2006
13 years 9 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
APAL
2006
13 years 9 months ago
2006
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
APAL
2006
13 years 9 months ago
2006
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
ARSCOM
2006
13 years 9 months ago
2006
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
BMCBI
2006
13 years 9 months ago
2006
Background: Providing for long-term and consistent public access to scientific data is a growing concern in biomedical research. One aspect of this problem can be demonstrated by ...