Concept
Tree model
Publications associées (6)
Self-help housing / autoconstruction
This is a historical inquiry on self-help housing, or autoconstruction as its French equivalent, a term mainly overlooked by architects but favoured by policymakers for low-cost housing development. Self-help housing has been a field of ‘aid’ or ‘assistanc ...
2021Incorporating Deep Bagging Ensemble Method as a Surrogate Model for Simulating Hyper-Concentrated Sediment-Laden Flows
David Andrew Barry, Seyed Mahmood Hamze Ziabari
Macroscale and mesoscale simulations of hyper-concentrated sediment-laden flows rely on robust couplings of the Reynolds-Averaged Navier-Stokes equations in conjunction with the shear-stress transport k-ω turbulence model. Also other closure laws for model ...
2019Dissecting HIV Virulence: Heritability of Setpoint Viral Load, CD4+ T Cell Decline and Per-Parasite Pathogenicity
Jacques Fellay, Gabriel Leventhal
Pathogen strains may differ in virulence because they attain different loads in their hosts, or because they induce different disease-causing mechanisms independent of their load. In evolutionary ecology, the latter is referred to as" per-parasite pathogen ...
Oxford University Press2018Tree-Based Pursuit: Algorithm and Properties
Pascal Frossard, Pierre Vandergheynst, Philippe Jost
This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...
2006Tree-Based Pursuit: Algorithm and Properties
Pascal Frossard, Pierre Vandergheynst, Philippe Jost
This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...
2005Finding an optimal inversion median: Experimental results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree using simple geometric properties of the problem and a newly available linear-ti ...
Springer-Verlag2001