-
...this paper studies the arrangement problem of uniform trees and shows that the arrangement complexity of a uniform tree is
either θ(1) or...a recursive algorithm to compute the optimal complete arrangements for θ(1) arrangeable balanced
uniform trees.
...
-
...we propose a reconfigurable low complexity non-uniform filter bank architecture based on the fast filter bank design for...filter bank is shown as the design example and the complexity comparison shows that our method is 58% less complex than the best known non-uniform discrete fourier transform filter bank...
-
...shown to depend critically both on the spatial arrangement of lgn synaptic contacts across the complex cell dendritic tree, established by a hebbian developmental...novel, experimentally testable hypothesis regarding the basis of orientation tuning in the complex cell population, and more generally underscores the potential im- portance of nonlinear intradendritic subunit processing in...
-
...is devoted to some aspects of the \p = np ?"problem over the real numbers and more general...circuits.point location, a problem of computational geometry, comes into play inthe study of these questions for several structures of interest.1 introductionin... ...
-
...applied to measuring 3d spatial complexity in the apical and basal dendritic trees of two functionally distinct types of macaque monkey neocortical pyramidal neurons...were compensatory, resulting in a uniform,slow reduction of mass with distance from the soma,over both scaling regions of the apical and basal trees. given a uniformly excitable membrane...
Published in 2005.
-
...model was used to assess the effects of diameter, age, recent
growth and competitive pressure on tree mortality.
–
• spatial pattern analysis indicated mortality was associated to tree neighbourhood (neighbour effect at 2–5 m). an increment
of regularization of tree spatial pattern occurred due to...
-
...knot invariants. for this case the $s_n$-action on the homology of the complex is also determined. for complexes of not $2$-connected $k$-hypergraphs...in particular, we show that the complex of not $(n-2)$-connected graphs is alexander dual to the complex of partial matchings of the complete graph. for not $(n...
-
the relationship between the ‘shape of an organ’ and the ‘cost of blood transport’ to perfuse its...length h/s ≤1). specifically, the effects of ‘shape’ on tree structure, blood transport, and on hemodynamic characteristics were investigated. branching models of arterial trees were generated by constrained constructive...
-
...which deal with physical applications of the eigenvalue statistics of ensembles of random matrices. the typical problems of rmt concern the evaluation of the averaged spectral density, as well...glasses, real networks and proteins. the description of such complex systems deals with the concept of hierarchical organization of energy landscapes (4, 5). a complex system is assumed to have...
Published in 2008.
-
...circuits. it turns out that the computation of the euler characteristic is fp #padd add - complete, while for xed k, the computation of the kth betti number is fparadd...poorly understood. a detailed account of the research on complexity of real functions within the classical framework can be found...