Sciweavers

3190 search results - page 28 / 638
» cans 2011
Sort
View
JSYML
2011
87views more  JSYML 2011»
14 years 4 months ago
Benign cost functions and lowness properties
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functi...
Noam Greenberg, André Nies
LLC
2011
167views more  LLC 2011»
14 years 4 months ago
Computational Phonology - Part II: Grammars, Learning, and the Future
Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative t...
Jeffrey Heinz
RSA
2011
89views more  RSA 2011»
14 years 4 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
SIAMNUM
2011
252views more  SIAMNUM 2011»
14 years 4 months ago
Analysis and Computation of Compatible Least-Squares Methods for div-curl Equations
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...
STTT
2011
195views more  STTT 2011»
14 years 4 months ago
Parallel probabilistic model checking on general purpose graphics processors
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski,...