Results 261 to 270 of about 7,019,409 (296)

Degree Reduction in Labeled Graph Retrieval

ACM Journal of Experimental Algorithmics, 2015
Within a given collection of graphs, a graph retrieval system may seek all graphs that contain a given graph, or may instead seek all graphs that are contained within a given graph. Although subgraph isomorphism is worst-case exponential, it may be average-case polynomial if graphs are labeled so as to restrict possible correspondences between vertices
openaire   +2 more sources

Degree Reduction of B-Spline Curves

1998
This work deals with the problem of degree reducing a B-spline curve without intermediate conversion to Bezier form. Degree elevation for B-spline curves may easily be described in blossom form. We also use blossoms for the degree reduction problem, and set up least squares problems for finding the B-spline coefficients directly.
Hans J. Wolters, G. Wu, Gerald E. Farin
openaire   +2 more sources

The degree structure of 1-L reductions

1992
A 1-L function is one that is computable by a logspace Turing machine that moves its input head only in one direction. We show that there exist 1-L complete sets for PSPACE that are not 1-L isomorphic. In other words, the 1-L complete degree for PSPACE does not collapse.
Hans-Jörg Burtschick, Albrecht Hoene
openaire   +2 more sources

Degree reduction for trigonometric functions

ACM SIGNUM Newsletter, 1983
This report is a companion to Reference 1 on radian reduction. As in Reference 1, the motivation arises from a desire to eliminate messages like "argument too large" in trigonometric function routines. The presence of very large arguments in the VAX H format, on the Crayl, and on an IEEE machine with extended registers, make this a real problem. As for
Mary H. Payne, Robert N. Hanek
openaire   +1 more source

Reduction to first degree in quantificational S5

Journal of Symbolic Logic, 1979
AbstractIt is shown that the modally first-degree formulas of quantificational S5 constitute a reduction class.
openaire   +3 more sources

Reduction, Branching and Degree Formulae

1992
Abstract The relationship between combinatorics and linear representations of the symmetric group has proved to be of mutual benefit to both. Much recent progress on the projective representation theory of the symmetric group depends on a combinatorial framework which allows one to develop a similar relationship. The main idea is that of
P N Hoffman, J F Humphreys
openaire   +1 more source

A Reduction Algorithm Based on the Degree of Attribute Discernibility

Sixth International Conference on Intelligent Systems Design and Applications, 2006
This paper studies the problem of attribute discernibility reduction and introduces some new concepts to Rough Set theory, such as Secondary Core, Regeneration Matrix and the degree of attribute discernibility. An attribute reduction algorithm has been proposed based on the concept of highest discernibility.
Zheng Zhang, Xinyu Shao, Daoyuan Yu, Peigen Li   +3 more
openaire   +1 more source

Identifying the Degree of Collusion Under Proportional Reduction

2017
Proportional reduction is a common cartel practice in which cartel members reduce their output proportionately. We develop a method to quantify this reduction relative to a benchmark market equilibrium scenario and relate the reduction to the traditional conduct parameter.
Shcherbakov, Oleksandr, Wakamori, Naoki
openaire   +2 more sources

Reduction of active degrees of freedom in motion learning

Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694), 2004
In this work, possibility of decreasing active degrees of freedom in the motion learning was investigated. For simplicity, it was focussed on producing the motion of a robot arm with four degrees of freedom only from a three-dimensional time sequence of Cartesian positions generated by movements of a mouse on pad while writing.
Kiyoshi Nishiyama, Koushi Ochisai
openaire   +2 more sources

Weighted Degree Trace Codes for PAPR Reduction

2005
Trace codes over the rings ${\mathbb Z}_{{2}^{l}}$, are used to construct spherical codes with controlled peak to average power ratios (PAPR). The main proof technique is the local Weil bound on hybrid character sums over Galois rings.
Patrick Solé, Dmitrii V. Zinoviev
openaire   +1 more source