6251 search results - page 420 / 1251 » Randomness, Computability, and Density |
189
click to vote
PG
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper describes a two pass algorithm capable of computing solutions to the global illumination in general environments (diffuse or glossy surfaces, anisotropically scattering...
164
click to vote
CF
2007
ACM
15 years 10 months ago
2007
ACM
This paper presents the Collapsed Bennett Layout, a general purpose floorplan for reversible quantum-dot cellular automata (QCA) circuits. In order to exploit the full density and...
165
click to vote
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
156
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
149
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: An adaptive coarse-grained (kinetic) Monte Carlo (ACGMC) simulation framework is applied to reaction and diffusion dynamics in inhomogeneous domains. The presented mod...