1007 search results - page 63 / 202 » The Complexity of Futile Questioning |
128
click to vote
IGPL
1998
15 years 3 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
119
click to vote
MOC
1998
15 years 3 months ago
1998
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
174
click to vote
PC
2002
15 years 3 months ago
2002
An emerging class of data-intensive applications involve the geographically dispersed extraction of complex scientific information from very large collections of measured or compu...
106
click to vote
SIAMAM
2002
15 years 3 months ago
2002
Abstract. We present numerical solutions of a two-dimensional Riemann problem for the unsteady transonic small disturbance equations that provides an asymptotic description of the ...
123
click to vote
TIT
1998
15 years 3 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...