All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 8 Next

Displaying 141 – 160 of 407

Showing per page

Smooth contour line construction with spline interpolation.

Pere Brunet Crosa, Lluis Pérez Vidal (1984)

Qüestiió

Contour maps are frequently used to represent three-dimensional surfaces from geographical applications or experimental results. In this paper, two new algorithms for the generation and display of such contours are presented. The first of them uses local spline interpolation to obtain contour maps from data points in a rectangular mesh, whereas the other interpolates a set of irregular points through recursive subdivision of triangles. In both algorithms, precision of the contours can be adjusted...

Smoothness and geometry of boundaries associated to skeletal structures I: sufficient conditions for smoothness

James Damon (2003)

Annales de l’institut Fourier

We introduce a skeletal structure ( M , U ) in ℝ n + 1 , which is an n - dimensional Whitney stratified set M on which is defined a multivalued “radial vector field” U . This is an extension of notion of the Blum medial axis of a region in ℝ n + 1 with generic smooth boundary. For such a skeletal structure there is defined an “associated boundary” ℬ . We introduce geometric invariants of the radial vector field U on M and a “radial flow” from M to ℬ . Together these allow us to provide sufficient numerical conditions for...

Software cost estimation with fuzzy inputs: Fuzzy modelling and aggregation of cost drivers

Miguel-Ángel Sicilia, Juan-J. Cuadrado-Gallego, Javier Crespo, Elena García Barriocanal (2005)

Kybernetika

Parametric software cost estimation models are well-known and widely used estimation tools, and several fuzzy extensions have been proposed to introduce a explicit handling of imprecision and uncertainty as part of them. Nonetheless, such extensions do not consider two basic facts that affect the inputs of software cost parametric models: cost drivers are often expressed through vague linguistic categories, and in many cases cost drivers are better expressed in terms of aggregations of second-level...

Solving a permutation problem by a fully polynomial-time approximation scheme

Stanisław Gawiejnowicz, Wiesław Kurc, Lidia Pankowska (2010)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

For a problem of optimal discrete control with a discrete control set composed of vertices of an n-dimensional permutohedron, a fully polynomial-time approximation scheme is proposed.

Solving conics over function fields

Mark van Hoeij, John Cremona (2006)

Journal de Théorie des Nombres de Bordeaux

Let F be a field whose characteristic is not  2 and K = F ( t ) . We give a simple algorithm to find, given a , b , c ∈ K * , a nontrivial solution in  K (if it exists) to the equation a X 2 + b Y 2 + c Z 2 = 0 . The algorithm requires, in certain cases, the solution of a similar equation with coefficients in F ; hence we obtain a recursive algorithm for solving diagonal conics over ℚ ( t 1 , ⋯ , t n ) (using existing algorithms for such equations over  ℚ ) and over 𝔽 q ( t 1 , ⋯ , t n ) .

Solving maximum independent set by asynchronous distributed hopfield-type neural networks

Giuliano Grossi, Massimo Marchi, Roberto Posenato (2006)

RAIRO - Theoretical Informatics and Applications

We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better than the...

Solving word equations

Habib Abdulrab (1990)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Some Algebraic Properties of Machine Poset of Infinite Words

Aleksandrs Belovs (2008)

RAIRO - Theoretical Informatics and Applications

The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.

Currently displaying 141 – 160 of 407