426 search results - page 40 / 86 » The Distribution of Patterns in Random Trees |
MP
2002
13 years 8 months ago
2002
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
TSP
2008
13 years 8 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
ICB
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Fingerprints are considered to be unique because they contain various distinctive features, including minutiae, ridges, pores, etc. Some attempts have been made to model ...
COCO
2009
Springer
14 years 8 days ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
BMCBI
2006
13 years 8 months ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...