Sciweavers

15416 search results - page 5 / 3084
» Embeddings of Computable Structures
Sort
View
JSYML
2007
66views more  JSYML 2007»
13 years 9 months ago
Spectra of structures and relations
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
Valentina S. Harizanov, Russel G. Miller
FOSSACS
2011
Springer
13 years 1 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
ICPR
2008
IEEE
14 years 4 months ago
Face super-resolution using 8-connected Markov Random Fields with embedded prior
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...