Sciweavers

652 search results - page 17 / 131
» Linear Explicit Substitutions
Sort
View
STOC
1995
ACM
88views Algorithms» more  STOC 1995»
13 years 11 months ago
Linear-time encodable and decodable error-correcting codes
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
Daniel A. Spielman
IPL
2010
141views more  IPL 2010»
13 years 2 months ago
On the differential and linear efficiency of balanced Feistel networks
Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear c...
Andrey Bogdanov
ESOP
2008
Springer
13 years 9 months ago
Practical Programming with Higher-Order Encodings and Dependent Types
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
Adam Poswolsky, Carsten Schürmann
RECOMB
2002
Springer
14 years 7 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
JCB
1998
105views more  JCB 1998»
13 years 7 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou