نتایج جستجو برای: inverse distance weighted

تعداد نتایج: 417665  

Journal: :Bioinformatics 2006
Levon Budagyan Ruben Abagyan

MOTIVATION Machine learning methods such as neural networks, support vector machines, and other classification and regression methods rely on iterative optimization of the model quality in the space of the parameters of the method. Model quality measures (accuracies, correlations, etc.) are frequently overly optimistic because the training sets are dominated by particular families and subfamili...

Journal: :Environmental science & technology 2004
Ryan S King Joseph R Beaman Dennis F Whigham Anson H Hines Matthew E Baker Donald E Weller

We related total PCBs (t-PCBs) in white perch (Morone americana), an abundant estuarine resident that supports a valuable recreational and commercial fishery in the mid-Atlantic region, to the amount and spatial arrangement of developed land in watersheds that discharge into 14 subestuaries of Chesapeake Bay. We considered the intensity of development in watersheds using four developed land-use...

2015
Amin Gheibi Anil Maheshwari Jörg-Rüdiger Sack

The minimum backward Fréchet distance (MBFD) problem is a natural optimization problem for the weak Fréchet distance, a variant of the well-known Fréchet distance. In this problem, a threshold ε and two polygonal curves, T1 and T2, are given. The objective is to find a pair of walks on T1 and T2, which minimizes the union of the portions of backward movements while the distance between the movi...

Journal: :IEEE Transactions on Robotics 2022

Solving the inverse kinematics problem is a fundamental challenge in motion planning, control, and calibration for articulated robots. Kinematic models these robots are typically parametrized by joint angles, generating complicated mapping between robot configuration end-effector pose. Alternatively, kinematic model task constraints can be represented using invariant distances points attached t...

Journal: :Journal of information and communication convergence engineering 2014

Journal: :Discrete Mathematics 2012
Peter Dankelmann

Let G be a given connected graph on n vertices. Suppose N facilities are located in the vertices of the graph. We consider the expected distance between two randomly chosen facilities. This is modelled by the following definition: Let G be a connected graph and let each vertex have weight c(v). The average distance of G with respect to c is defined as µ c (G) = N 2 −1 {u,v}⊆V (G) d G (u, v), wh...

2010
José M. Merigó Anna M. Gil-Lafuente

We develop a new decision making model by using distance measures, weighted averages and OWA operators. We introduce the induced ordered weighted averaging – weighted averaging distance (IOWAWAD) operator. We study some of its main properties and particular cases such as the weighted Hamming distance, the induced OWA distance (IOWAD), the arithmetic weighted distance and the arithmetic IOWAD op...

Journal: :Filomat 2022

The notion of the weighted (b,c)-inverse an element in rings were introduced very recently. In this paper, we further elaborate on theory by establishing a few characterizations inverse and their relationships with other (v,w)-weighted (b,c)-inverses. We discuss necessary sufficient conditions for existence hybrid annihilator (b, c)-inverse ring. addition, explore reverse-order law

Journal: :The Electronic Journal of Linear Algebra 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید