Sciweavers

768 search results - page 62 / 154
» Asymptotic Cellular Complexity
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
JCSS
2008
120views more  JCSS 2008»
13 years 7 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
ACRI
2008
Springer
14 years 2 months ago
On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
Genaro Juárez Martínez, Andrew Adama...
BMCBI
2005
109views more  BMCBI 2005»
13 years 7 months ago
Automation of gene assignments to metabolic pathways using high-throughput expression data
Background: Accurate assignment of genes to pathways is essential in order to understand the functional role of genes and to map the existing pathways in a given genome. Existing ...
Liviu Popescu, Golan Yona
TIT
1998
123views more  TIT 1998»
13 years 7 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu