Sciweavers

22 search results - page 1 / 5
» The limitations of cupping in the local structure of the enu...
Sort
View
AML
2010
91views more  AML 2010»
13 years 5 months ago
The limitations of cupping in the local structure of the enumeration degrees
Abstract We prove that a sequence of sets containing representatives of cupping partners for every nonzero 0 2 enumeration degree cannot have a 0 2 enumeration. We also prove that ...
Mariya Ivanova Soskova
APAL
2010
85views more  APAL 2010»
13 years 5 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
JSYML
2008
108views more  JSYML 2008»
13 years 4 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
APBC
2004
117views Bioinformatics» more  APBC 2004»
13 years 6 months ago
Detecting Local Symmetry Axis in 3-dimensional Virus Structures
This paper presents an efficient computational method to identify a local symmetry axis in 3-dimensional viral structures obtained using electron cryomicroscopy. Local symmetry is...
Jing He, Desh Ranjan, Wen Jiang, Wah Chiu, Michael...
SKG
2006
IEEE
13 years 11 months ago
An Ontology Based Local Index in P2P Networks
Peer-to-peer networks (P2P) are beginning to form the infrastructure of future applications. One of the problems with unstructured P2P networks is their scalability limitation. Th...
Habib Rostami, Jafar Habibi, Hassan Abolhassani, M...