Sciweavers

1557 search results - page 29 / 312
» Programming up to Congruence
Sort
View
WSC
2004
15 years 8 days ago
A View From the Beginning: When Does a Description Become a Taxonomy
This paper describes the author's career leading up to the publication of his 1969 paper Digital Computer Simulation: Computer Programming Languages, how it influenced the pa...
Philip J. Kiviat
MICRO
2000
IEEE
118views Hardware» more  MICRO 2000»
15 years 3 months ago
A study of slipstream processors
A slipstream processor reduces the length of a running program by dynamically skipping computation non-essential for correct forward progress. The shortened program runs faster as...
Zachary Purser, Karthik Sundaramoorthy, Eric Roten...
BMCBI
2007
219views more  BMCBI 2007»
14 years 11 months ago
MetaQTL: a package of new computational methods for the meta-analysis of QTL mapping experiments
Background: Integration of multiple results from Quantitative Trait Loci (QTL) studies is a key point to understand the genetic determinism of complex traits. Up to now many effor...
Jean-Baptiste Veyrieras, Bruno Goffinet, Alain Cha...
99
Voted
CORR
2007
Springer
173views Education» more  CORR 2007»
14 years 11 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
115
Voted
SIAMDM
2010
137views more  SIAMDM 2010»
14 years 9 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam