Sciweavers

1579 search results - page 237 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
ISMB
1997
15 years 7 months ago
Inferring Gene Structures in Genomic Sequences Using Pattern Recognition and Expressed Sequence Tags
Abstract.) Ying Xu, Richard J. MuraF, and Edward C. Uberbacher Computer Science and Mathematics Division and tLife Sciences Division Computational methods for gene identification ...
Ying Xu, Richard J. Mural, Edward C. Uberbacher
GG
2008
Springer
15 years 7 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 6 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
CORR
2008
Springer
157views Education» more  CORR 2008»
15 years 6 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
CC
1998
Springer
111views System Software» more  CC 1998»
15 years 6 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson