Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under
โฆ LIBER โฆ
Optimal choice of modes for aggregation
โ Scribed by C. Commault
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 238 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Optimal aggregation algorithms for middl
โ
Ronald Fagin; Amnon Lotem; Moni Naor
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 427 KB
Choice of optimal maintenance strategy f
โ
V. Yu. Kaminskii; V. A. Ponomarenko; S. N. Kurakin
๐
Article
๐
1985
๐
Springer US
๐
English
โ 434 KB
Choice of optimal conditions for interna
โ
V. M. Zolotarev; N. P. Spasskova; L. V. Lesnevskaya; G. N. Guseva; M. S. Vilesov
๐
Article
๐
1971
๐
Springer US
๐
English
โ 258 KB
Optimal choice of observation window for
โ
Yury A. Kutoyants; Vladimir Spokoiny
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 112 KB
We consider the possibility of optimal choice of observation window in the problem of parameter estimation by the observations of an inhomogeneous Poisson process. A minimax lower bound is proposed for the risk of estimation under an arbitrary choice of observation window. Then the adaptive procedur
Optimal choice of checking sequence for
โ
G. A. Donets; I. I. Popov
๐
Article
๐
1976
๐
Springer US
๐
English
โ 194 KB
Choice of optimal search strategy
โ
Y. Rubinstein
๐
Article
๐
1976
๐
Springer
๐
English
โ 404 KB