It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
Michael D. Smith, Norman Ramsey, Glenn H. Holloway
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...