Search academic resources

We present an evolutionary algorithm that evolves a population of local approximators in order to fit an unknown function. The evolutionary algorithm performs a simultaneous learning of simple local approximators togethe...

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network...

Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespre...

Protein Folding is an important open problem in the eld of Computational Biology Due to its com binatorial nature exact polynomial algorithms to solve it could not exist and so approximation algorithms and heurist...

Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the labels should vary smoothly almost everywhere while preserving sharp discontinuities that may ex...

In this paper, we explore the concept of mutually unbiased bases (MUBs) in discrete quantum systems. It is known that for dimensions d that are powers of prime numbers, there exists a set of up to d+1 bases that form an ...

Engineering and physics applications are described mathematically as a system of Volterra integral equations (SVIEs). Although many numerical techniques have been considered to solve SVIEs, developing more stable, and ef...

We study the local approximation properties in hierarchical spline spaces through multiscale quasi-interpolation operators. This construction suggests the analysis of a subspace of the classical hierarchical spline space...

We present results from a data challenge posed to the radial velocity (RV) community: Namely, to quantify the Bayesian "evidence"for n = {0, 1, 2, 3} planets in a set of synthetically generated RV data sets containing a ...

The clustering of small molecules implies the organization of a group of chemical structures into smaller subgroups with similar features. Clustering has important applications to sample chemical datasets or libraries in...

Abstract The self-scaling VM-algorithms solves an unconstrained non-linear optimization problems by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigen-values...

Currently, the urgent task is to assess the small-sized maneuvering UAVs movement parameters. The location of an unknown UAV as a radio source can be determined using AoA measurements of the wireless sensor network. To d...

Digital phantoms are virtual representations of the human body used in medical research to test equipment, train medical professionals and develop or validate algorithms. These models can be created from ‘real-world’...

Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures ...

Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, w...

Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest-descent m...

Boundary extraction is an important procedure associated with recognition and interpretation tasks in digital image processing and computer vision. Most of the segmentation techniques are based on the detection of the lo...

Conventional operating systems, like Silicon Graphics' IRIX and IBM's AIX, adopt a single Memory Management algorithm. The choice of this algorithm is usually based on its good performance in relation to the set of progr...

Se presentan algoritmos para la generación de mallas poligonales a partir de conjuntos de puntos batimétricos correspondientes a canales de navegación, cuya geometría se corresponde con distintos cortes transversales...

Web Engines are a useful tool for searching information in the Web. But a great part of this information is non-textual and for that case a metric space is used. A metric space is a set where a notion of distance (call...

Previous article Next article An Algorithm for Least-Squares Estimation of Nonlinear ParametersDonald W. MarquardtDonald W. Marquardthttps://doi.org/10.1137/0111030PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport Ci...

In visualization applications, the data has been increasing its size at very big rates. Processing of the whole data in main memory becomes impossible due to size limitations. A way of dealing with this constraint is to ...

Fuzzy rule-based systems have proved to be a convenient tool for modeling complex systems. This is due to their capacity to capture their typical imprecision, which makes classical methods inefficient. At present, Fuzzy...