Cerca risorse accademiche

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...

Formal languages and automata theory (FL&AT) are central subjects in the CS curricula which are usually diffcult both to teach and to learn. This situation has motivated the development of a number of computer simulators...

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...

This book is an applied introduction to the problems and solutions of modern computer vision. It offers a collection of selected, well-tested methods (theory and algorithms), aiming to balance difficulty and applicabilit...

A basic problem in computer vision is to understand the structure of a real world scene given several images of it. Techniques for solving this problem are taken from projective geometry and photogrammetry. Here, the aut...

QUANTUM ESPRESSO is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density-functional theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft, a...

Genetic algorithms have been used in science and engineering as adaptive algorithms for solving practical problems and as computational models of natural evolutionary systems. This brief, accessible introduction describe...

Historically Functional Programming FP for short has been associated with a small scope of applications mainly academic The computer science community did not pay enough attention to its potential perhaps due t...

This brief perspective article focuses on the most common errors and pitfalls, as well as the do's and don'ts in drug combination studies, in terms of experimental design, data acquisition, data interpretation, and compu...

Machine learning addresses the question of how to build computers that improve automatically through experience. It is one of today's most rapidly growing technical fields, lying at the intersection of computer science a...

"The scientific study of networks, including computer networks, social networks, and biological networks, has received an enormous amount of interest in the last few years. The rise of the Internet and the wide availabil...

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...

Papers from the 2006 flagship meeting on neural computation, with contributions from physicists, neuroscientists, mathematicians, statisticians, and computer scientists. The annual Neural Information Processing Systems (...

Materie / parole chiave: Computer science; Mathematics; Set theory; Problems, exercises, etc; Algorithms; Logic, Symbolic and mathematical; Problems and exercises; Electronic books

The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length of the code. For all but pathological channe...

The recent development of various methods of modulation such as PCM and PPM which exchange bandwidth for signal-to-noise ratio has intensified the interest in a general theory of communication. A basis for such a theory ...

A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of parameters, the algorithm provides a super astronomical period of 2 19937 −1 and 623-dime...

Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear Diophantine Equations. Algorit...

A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications. presents in-depth, self-...

Materie / parole chiave: Karush–Kuhn–Tucker conditions; Nonlinear programming; Nonlinear system; Saddle point; Mathematical optimization; Duality (order theory); Mathematics; Linear programming; Function (biology); Convex optimization; Conve...

Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which depends on a subset of the varia...

The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on th...

Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (where M is the number of objectives and N is th...

Many scientific phenomena are now investigated by complex computer models or codes. A computer experiment is a number of runs of the code with various inputs. A feature of many computer experiments is that the output is ...