On selecting the k largest with restricted quadratic queries
✍ Scribed by William I. Gasarch
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 272 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract This paper is concerned with techniques for identifying simple and quantified lattice points in 2SAT polytopes. 2SAT polytopes generalize the polyhedra corresponding to Boolean 2SAT formulas, Vertex‐Packing (Covering, Partitioning) and Network flow problems; they find wide application i
## Abstract One frontier of modern statistical research is the problems arising from data sets with extremely large __k__ (>1000) populations, e.g. microarray and neuroimaging data. For many such problems the focus shifts from testing for significance to selecting, filtering, or screening. Classica