3134 search results - page 121 / 627 » Computing full disjunctions |
106
Voted
CIE
2008
Springer
15 years 2 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
111
Voted
SIVP
2008
15 years 2 months ago
2008
In this paper, a new method for extracting the system phase from the bispectrum of the system output has been proposed. This is based on the complete bispectral data computed in t...
123
Voted
IJVR
2007
15 years 2 months ago
2007
— Rendering large crowds of characters requires a great amount of computational power. To increase the efficiency for this render, we propose the use of the graphics processor, i...
74
Voted
TC
2008
15 years 2 months ago
2008
Abstract-- A radix-2 digit-recurrence algorithm and architecture for the computation of the cube root are presented in this paper. The original recurrence based on the concept of c...
99
Voted
AAECC
2000
Springer
15 years 2 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...