Sciweavers

528 search results - page 69 / 106
» Degrees of categoricity of computable structures
Sort
View
BICOB
2010
Springer
14 years 1 months ago
Algebraic Theory of DNA Recombination
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
Sergei R. Sverchkov
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
ALP
1992
Springer
14 years 23 days ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
CHI
2001
ACM
14 years 9 months ago
Visualization components for persistent conversations
An appropriately designed interface to persistent, threaded conversations could reinforce socially beneficial behavior by prominently featuring how frequently and to what degree e...
Marc A. Smith, Andrew T. Fiore
MFCS
2007
Springer
14 years 2 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril