Sciweavers

920 search results - page 42 / 184
» Accurate Step Counting
Sort
View
SASO
2008
IEEE
15 years 4 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 1 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
BMCBI
2004
134views more  BMCBI 2004»
14 years 9 months ago
Bayesian model accounting for within-class biological variability in Serial Analysis of Gene Expression (SAGE)
Background: An important challenge for transcript counting methods such as Serial Analysis of Gene Expression (SAGE), "Digital Northern" or Massively Parallel Signature ...
Ricardo Z. N. Vêncio, Helena Brentani, Diogo...
JCT
2010
83views more  JCT 2010»
14 years 8 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
PROMISE
2010
14 years 4 months ago
Defect cost flow model: a Bayesian network for predicting defect correction effort
Background. Software defect prediction has been one of the central topics of software engineering. Predicted defect counts have been used mainly to assess software quality and est...
Thomas Schulz, Lukasz Radlinski, Thomas Gorges, Wo...