Sciweavers

5372 search results - page 230 / 1075
» complexity 2007
Sort
View
ANNALS
2006
63views more  ANNALS 2006»
13 years 8 months ago
The Virtual Life of ENIAC: Simulating the Operation of the First Electronic Computer
This paper describes an interactive simulation of the Electronical Numerical Integrator and Computer (ENIAC). With the simulator, the user can wire up complex configurations of th...
Till Zoppke, Raúl Rojas
BMCBI
2007
94views more  BMCBI 2007»
13 years 8 months ago
Transcriptional regulation at a glance
Considering that 80 genomes have been sequenced, providing us with the static information of the genome, it is still a long way to reveal the relationship between complex genotype...
Silke Sperling
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
13 years 8 months ago
A Characterization of Balanced Episturmian Sequences
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
Geneviève Paquin, Laurent Vuillon
AMC
2005
146views more  AMC 2005»
13 years 8 months ago
A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
André L. Moura, José R. Camacho, Seb...
IPL
2007
100views more  IPL 2007»
13 years 8 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li