๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Frequency computation and bounded queries

โœ Scribed by Richard Beigel; William Gasarch; Efim Kinber

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1014 KB
Volume
163
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the computational complexity of query
On the computational complexity of querying bounds on differences constraints
โœ Vittorio Brusoni; Luca Console; Paolo Terenziani ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 891 KB

Given a consistent knowledge base formed by a set of constraints, efficient query answering (e.g., checking whether a set of constraints is consistent with the knowledge base or necessarily true in it) is practically very important. In the paper we consider bounds on differences (which are an import

Attribute-Efficient Learning in Query an
Attribute-Efficient Learning in Query and Mistake-Bound Models
โœ Nader Bshouty; Lisa Hellerstein ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 351 KB

We consider the problem of attribute-efficient learning in query and mistake-bound models. Attribute-efficient algorithms make a number of queries or mistakes that is polynomial in the number of relevant variables in the target function, but only sublinear in the number of irrelevant variables. We c

Bounded-error data, and frequency respon
Bounded-error data, and frequency response design
โœ B. Kouvaritakis; M.S. Trimboli ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 908 KB

The presence of bounded-noise in identification data implies uncertainty in the parameters of system models. Earlier results provide analytical means for determining optimal ellipsoidal regions that bound the vector of parameters. Parameter space information however is only of secondary interest in