Results 271 to 280 of about 75,945 (317)

Internet-Based Psycho-Physical Exercise Intervention Program in Mild-to-Moderate Depression: The Study Protocol of the SONRIE Randomized Controlled Trial. [PDF]

Int J Environ Res Public Health
Escudier-Vázquez JM, Ruiz-Muñoz M, Garrido-Palomino I, Ortega-Gómez S, Valmisa Gómez de Lara EJ, Espinosa Nogales MDM, Viglerio Montero A, Rosety-Rodríguez MÁ, Jiménez-Pavón D, Carbonell-Baeza A, España-Romero V.   +10 more
europepmc   +1 more source

Anisotropic interaction and motion states of locusts in a hopper band. [PDF]

Proc Biol Sci
Weinburd J, Landsberg J, Kravtsova A, Lam S, Sharma T, Simpson SJ, Sword GA, Buhl C.   +7 more
europepmc   +1 more source

A High-Precision Method for Warehouse Material Level Monitoring Using Millimeter-Wave Radar and 3D Surface Reconstruction. [PDF]

Sensors (Basel)
Zhang W, Gu Y.
europepmc   +1 more source

Evaluating and refining undersea cable path planning algorithms: A comparative study. [PDF]

PLoS One
Wang T, Wang Z, Moran B, Wang X, Zukerman M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Distributed fast marching methods

Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities, 2008
Fast Marching represents a very efficient technique for solving the front propagation problems which can be formulated as boundary value partial differential equations |∇T(x, y)| = 1/F(x, y) on Ω, with Dirichlet boundary condition T(x, y) = 0 on ∂Ω. We show that the problem of computing the distance map across a smooth sampling domain can be posed in ...
Blaise Bourdin, Maria Cristina Tugurlan
openaire   +2 more sources

Remarks on the implementation of the fast marching method

IMA Journal of Numerical Analysis, 2008
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N log N) time, where the factor log N is due to the administration of a priority queue. Recently, Yatziv et al. (2006, J. Comput. Phys., 212, 393-399) have suggested using an untidy priority queue, reducing the overall complexity to O(N) at the price of a small ...
Christian Rasch, Thomas Satzger
openaire   +2 more sources

Fast Marching Methods

SIAM Review, 1999
Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static Hamilton--Jacobi equations. Based on entropy-satisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms.
openaire   +1 more source

Generalized fast marching method: applications to image segmentation

Numerical Algorithms, 2008
In this paper, we propose a segmentation method based on the generalized fast marching method (GFMM) developed by Carlini et al. (submitted). The classical fast marching method (FMM) is a very efficient method for front evolution problems with normal velocity (see also Epstein and Gage, The curve shortening flow. In: Chorin, A., Majda, A.
Carole Le Guyader, Carole Le Guyader, Christian Gout, Christian Gout, Christian Gout, Nicolas Forcadel   +5 more
openaire   +4 more sources