Results 281 to 290 of about 3,023,466 (332)
A deep learning methodology for fully-automated quantification of calcific burden in high-resolution intravascular ultrasound images. [PDF]
He X +14 more
europepmc +1 more source
Balancing opposing cues: seasonal shifts in push-pull drivers of migration in a temperate waterfowl species. [PDF]
Bakner NW +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Jackknife minimum distance estimation
Economics Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kézdi, Gábor +2 more
openaire +2 more sources
Journal of Statistical Planning and Inference, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hettmansperger, T. P. +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hettmansperger, T. P. +2 more
openaire +1 more source
Minimum Average Distance Clique Trees
SIAM Journal on Discrete Mathematics, 2015Summary: Chordal graphs have been extensively studied and have applications in various fields, including computational biology, sparse matrix computation, and graphical models. They are characterized by the existence of clique trees, whose vertices correspond to the maximal cliques of a chordal graph.
Xu, Shou-Jun, Gysel, Rob, Gusfield, Dan
openaire +2 more sources
Viewing distance with minimum heterophoria
Clinical and Experimental Optometry, 1999BACKGROUND: The purposes of this study are to determine the viewing distance with minimum heterophoria and its relationship with refractive error and the resting position of accommodation. METHODS: The heterophoria and the accommodation responses of 36 optometry students (25 emmetropes and 11 myopes) were tested. Heterophoria was measured with the Free-
Ai-Hong, Chen, Abdul, Aziz
openaire +2 more sources
Computer Vision and Image Understanding, 2013
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions f"A, whose domain D is a compact subsets of the Euclidean space R^n. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R^n, as well as in the case where D is a digital scene.
Robin Strand +3 more
openaire +1 more source
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions f"A, whose domain D is a compact subsets of the Euclidean space R^n. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R^n, as well as in the case where D is a digital scene.
Robin Strand +3 more
openaire +1 more source

