Results 281 to 290 of about 497,884 (333)
Some of the next articles are maybe not open access.
ACM Transactions on Computation Theory, 2014
This article studies property testing for NP optimization problems with parameter k under the general graph model with an augmentation of random edge sampling capability. It is shown that a variety of such problems, including k -Vertex Cover, k -Feedback Vertex Set,
Kazuo Iwama, Yuichi Yoshida
openaire +1 more source
This article studies property testing for NP optimization problems with parameter k under the general graph model with an augmentation of random edge sampling capability. It is shown that a variety of such problems, including k -Vertex Cover, k -Feedback Vertex Set,
Kazuo Iwama, Yuichi Yoshida
openaire +1 more source
Periodic global parameterization [PDF]
ACM Transactions on Graphics, 2006 We present a new globally smooth parameterization method for the triangulated surfaces of arbitrary topology. Given two orthogonal piecewise linear vector fields defined over the input mesh (typically the estimated principal curvature directions), our method computes two piecewise linear periodic functions, aligned with the input vector fields, by ...
Bruno Levy
exaly +2 more sources
IEEE Transactions on Software Engineering, 1984
Summary: Parameterized programming is a powerful technique for the reliable reuse software. In this technique, modules are parameterized over very general interfaces that describe what properties of an environment are required for the module to work correctly.
openaire +2 more sources
Summary: Parameterized programming is a powerful technique for the reliable reuse software. In this technique, modules are parameterized over very general interfaces that describe what properties of an environment are required for the module to work correctly.
openaire +2 more sources
Reconstructing Parameterized Strings from Parameterized Suffix and Lcp Arrays
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir, Amihood +4 more
openaire +2 more sources
PARAMETERIZATION USING MANIFOLDS
International Journal of Shape Modeling, 2004Summary: There are a variety of surface types (such as meshes and implicit surfaces) that lack a natural parameterization. We believe that manifolds are a natural method for representing parameterizations because of their ability to handle arbitrary topology and represent smooth surfaces.
openaire +2 more sources
Quantile-Parameterized Distributions
Decision Analysis, 2011This paper introduces a new class of continuous probability distributions that are flexible enough to represent a wide range of uncertainties such as those that commonly arise in business, technology, and science. In many such cases, the nature of the uncertainty is more naturally characterized by quantiles than by parameters of familiar continuous ...
Keelin, Thomas W., Powley, Bradford W.
openaire +1 more source
Parameterized Random Complexity
Theory of Computing Systems, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Müller, Moritz, Montoya, Juan Andres
openaire +1 more source
Approximate Parameterized Matching
ACM Transactions on Algorithms, 2004Two equal length strings s and s ′, over alphabets Σ s and Σ s ′, parameterize match if there exists a bijection π : Σ s
Carmit Hazay +2 more
openaire +1 more source
Canadian Journal of Mathematics, 1957
A matrix P with elements from an arbitrary field is called a cogredient automorph (c.a.) of a symmetric matrix A if P'AP = A, where P' is the transpose of P.
openaire +2 more sources
A matrix P with elements from an arbitrary field is called a cogredient automorph (c.a.) of a symmetric matrix A if P'AP = A, where P' is the transpose of P.
openaire +2 more sources