Sciweavers

1005 search results - page 112 / 201
» On genomic coding theory
Sort
View
APAL
1998
121views more  APAL 1998»
13 years 7 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
JSC
2010
105views more  JSC 2010»
13 years 6 months ago
Programming with narrowing: A tutorial
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
Sergio Antoy
SANSKRIT
2010
13 years 5 months ago
Sanskrit Compound Processor
Sanskrit is very rich in compound formation. Typically a compound does not code the relation between its components explicitly. To understand the meaning of a compound, it is neces...
Anil Kumar, Vipul Mittal, Amba Kulkarni
TELSYS
2010
121views more  TELSYS 2010»
13 years 2 months ago
Packet level performance analysis of a packet scheduler exploiting multiuser diversity
In this paper, we consider a packet scheduler exploiting multiuser diversity in a wireless network with AMC (Adaptive Modulation and Coding), and propose a packet level performance...
Gang Uk Hwang, Fumio Ishizaki
COLING
2000
13 years 9 months ago
A Model of Competence for Corpus-Based Machine Translation
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...
Michael Carl