A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Using information systems to solve recursive domain equations

1991
*
Information and Computation
*

This paper aims

doi:10.1016/0890-5401(91)90068-d
fatcat:pdpceblgknbmdlkldbwvzwjbrm
*to*make the following main contribution:*to*show how*to**use*the concrete nature of Scott's*information**systems**to*advantage in*solving**recursive**domain**equations*. ... Standard*domain*constructions like function space can be made continuous on this cpo so the solution of*recursive**domain**equations*reduces*to*the more familiar construction of forming the least fixed-point ... ACKNOWLEDGMENTS Our debt*to*the work of Dana Scott is clear. We are grateful*to*C. A. R. Hoare for suggested improvements. ...##
###
Low-complexity adaptive channel estimation for MIMO-OFDM systems over rayleigh fading channels

2013
*
2013 1st International Conference on Communications, Signal Processing, and their Applications (ICCSPA)
*

In this paper, we propose novel low-complexity adaptive scheme infrequency

doi:10.1109/iccspa.2013.6487328
fatcat:2jky5y7zkvf5hcqtia7hacbstu
*domain*for estimation of MIMO-OFDM channels.Computational complexity of*recursive*least square (RLS)estimation algorithm is reduced ... Simulation results demonstrate the*usefulness*of the proposed scheme for MIMO-OFDMchannel estimation. ... In the QR decomposition*recursive*least squares (QRD-RLS) algorithm, triangular transformation*using*Givens rotations is*used**to**recursively**solve*the LS problem. ...##
###
Fast and recursive algorithms for magnitude retrieval from DTFT phase at irregular frequencies

1999
*
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)
*

In the special case of equally-spaced frequency samples, it is related

doi:10.1109/icassp.1999.756280
dblp:conf/icassp/Yagle99
fatcat:p7sugi4xsvb2ddrop7bzapvxge
*to*a previous algorithm. The second algorithm is*recursive*at each*recursion*a meaningful magnitude retrieval problem is*solved*. ... This is*useful*for updating a solution; it also allows checking of the result at each*recursion*, avoiding any errors due*to*computational roundo error and ill-conditioning of the problem. ... Note that this is similar in concept*to*the Levinson algorithm, which*recursively**solves*Toeplitz*systems*of*equations*of increasing size. ...##
###
Solving Systems of Polynomial Equations: a Novel End Condition and Root Computation Method

2014
*
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems
*

In this paper we present an improvement of the algorithm based on

doi:10.15439/2014f183
dblp:conf/fedcsis/Bartoszuk14
fatcat:yk57cftpibehrmvakbzz3gdpta
*recursive*de Casteljau subdivision over an ndimensional bounded*domain*(simplex or box). ... Both innovations are based on linear approximation of polynomials in a*system*. ... ACKNOWLEDGMENT Maciej Bartoszuk would like*to*acknowledge the support by the European Union from resources of the European Social Fund, Project PO KL "*Information*technologies: Research and their interdisciplinary ...##
###
Descriptor-in-Context Index

1972
*
IEEE transactions on computers
*

DESCRIPTOR-IN-CONTEXT INDEX

doi:10.1109/tc.1972.5009030
fatcat:2psekyc5dncjhpfifn263sdtbu
*Uses*of Charge-Transfer Devices and Mag-Generation of Fault Tests for Linear Logic*Information*Structuring and Retrieval*Us*-netic-*Domain*Devices in Memory Hier-*Domain*Tip Devices ... and*to*the ing Hierarchic Classification 9719 Handlciong of*System*alEfur nction 9748 Personnel*Information**System**Using*On-Design of Digital Magnetic Recording Generating Multipliers for a Cellular Fast ...##
###
Page 1705 of Mathematical Reviews Vol. , Issue 86d
[page]

1986
*
Mathematical Reviews
*

G. (4-EDIN-C); Winskel, G. (4-CAMB-C)

*Using**information**systems**to**solve**recursive**domain**equations*effectively. Semantics of data types ( Valbonne, 1984), 109-129, Lecture Notes in Comput. ... One is*to*show how*to**use*the concrete representation of Scott’s in- formation*systems**to*advantage in*solving**recursive**domain*equa- tions. ...##
###
Page 7470 of Mathematical Reviews Vol. , Issue 94m
[page]

1994
*
Mathematical Reviews
*

The constructions are based on a standard fixed-point result for w-categories,

*solving*a set of*recursive**domain**equations*by an inverse-limit construction in a product category. ... In order*to*satisfy both the*recursive**domain**equations*and the coherence 68 COMPUTER SCIENCE 7470 conditions one has*to*consider an inverse-limit construction in a functor category from the subtype relation ...##
###
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
[chapter]

2004
*
Lecture Notes in Computer Science
*

Our type reconstruction algorithm is capable of inferring cost

doi:10.1007/978-3-540-27861-0_6
fatcat:tqwvfpp67vbqxf7vkghuhqiany
*equations*for a subset of*recursive*programs whose costs can be expressed*using*primitive*recursion*. ... We illustrate the approach with reference*to*some standard examples of*recursive*programs. ... Finally, we have not yet constructed soundness or completeness proofs relating our inference algorithm*to*the type*system*. ...##
###
Page 7056 of Mathematical Reviews Vol. , Issue 92m
[page]

1992
*
Mathematical Reviews
*

This allows

*us**to*reduce the given nonhomogeneous problem*to*the homogeneous case, and*to**use*the*recursive*method already described for that problem*to*find a solution u, of this new elliptic problem, ... The reduced*systems*obtained on the interface correspond quite directly*to*standard algorithms obtained when standard con- forming finite elements are*used*. ...##
###
Logical levels of problem solving

1984
*
The Journal of Logic Programming
*

Three levels of knowledge necessary for intelligent problem

doi:10.1016/0743-1066(84)90002-5
fatcat:7aofsfkx6vekfmnwx7fvck3wli
*solving*are identified-a level of*domain*knowledge, a level of methods and strategies, and a planning level. ... He describes three spaces, a strategy space, a design space, and a laboratory space, which correspond, respectively,*to*the planning level, methods level, and*domain*level introduced here. ... The message of the expert*system*experience is that*using**domain*knowledge is important. ...##
###
I-Categories as a framework for solving domain equations

1993
*
Theoretical Computer Science
*

Smyth, I-categories as a framework for

doi:10.1016/0304-3975(93)90056-y
fatcat:q5gvycn4rnhvjbp2igf4qlgkru
*solving**domain**equations*, Theoretical Computer Science 115 (1993) 77-106. ... An abstract notion of category of*information**systems*or I-category is introduced as a generalisation of Scott's well-known category of*information**systems*. ... The first author thanks Samson Abramsky, Achim Jung and Steve Vickers for discussions on*information**systems*and*domain*theory. ...##
###
A fast algorithm for linear estimation of two- dimensional isotropic random fields

1985
*
IEEE Transactions on Information Theory
*

These

doi:10.1109/tit.1985.1057088
fatcat:b6usunaxeza5hmushvpnrorsuq
*equations*will be*used**to*estimate the field and*to*compute the optimum filter*recursively*as the radius of the observation disk increases. ... In the spectral*domain*they take the form of SchGdinger*equations*, which are*used**to*give an inverse spectral interpretation of our estimation procedure. I. ... Then,*to*compute c,,(R, o), one method would be*to*discretize the interval [0, R] into N subintervals of length A = R/N and*to**solve*the resulting*system*of linear*equations*. ...##
###
Page 2654 of Mathematical Reviews Vol. , Issue 83f
[page]

1983
*
Mathematical Reviews
*

The dynamics ‘of ‘the

*information**domains*are given*recursively*via duality and dynamic programming. ... The concept of an “*information**domain*consistent with the signal realized” is introduced and includes the best*information*available regarding the true state. ...##
###
Using the parallel algebraic recursive multilevel solver in modern physical applications

2004
*
Future generations computer systems
*

This paper discusses the application of a few parallel preconditioning techniques, which are collected in a recently developed suite of codes Parallel Algebraic

doi:10.1016/s0167-739x(03)00189-4
fatcat:4xymdyprajdjnnzwtcsusphbvm
*Recursive*Multilevel Solver (pARMS),*to*... tackling large-scale sparse linear*systems*arising from real-life applications. ...*equations*from the neighboring sub-*domain*number j and N i is the set of sub-*domains*that are neighbors*to*sub-*domain*i. ...##
###
Page 3972 of Mathematical Reviews Vol. , Issue 91G
[page]

1991
*
Mathematical Reviews
*

This provides some simplifications and improvements

*to*the algorithm, thus allowing*us**to*achieve an effective implementation*solving*nontrivial*equations*.” 68S Mathematical linguistics See also 03028, ... Summary: “*Recursive*inference rules arise in*recursive*definitions in logic programming*systems*and in database*systems*with recur- sive query languages. ...
« Previous

*Showing results 1 — 15 out of 85,014 results*