<--- Back to Details
First PageDocument Content
Regression analysis / Sampling / Statistical inference / Heteroscedasticity / Linear regression / Survey sampling / Randomization / Sample / Estimation theory / Statistics / Econometrics / Survey methodology
Date: 1999-09-29 14:19:22
Regression analysis
Sampling
Statistical inference
Heteroscedasticity
Linear regression
Survey sampling
Randomization
Sample
Estimation theory
Statistics
Econometrics
Survey methodology

Model-Based Sampling, Inference and Imputation James R. Knaub, Jr., Energy Information Administration, EIKey Words: Survey statistics, Randomization, Conditionality, Random sampling, Cutoff

Add to Reading List

Source URL: www.eia.gov

Download Document from Source Website

File Size: 63,49 KB

Share Document on Facebook

Similar Documents

Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

DocID: 1vs6Y - View Document

2013 IEEE Symposium on Security and Privacy  Practical Control Flow Integrity & Randomization for Binary Executables Chao Zhang1 , Tao Wei1,2∗ , Zhaofeng Chen1 , Lei Duan1 , L´aszl´o Szekeres2,3+ , Stephen McCamant2,

2013 IEEE Symposium on Security and Privacy Practical Control Flow Integrity & Randomization for Binary Executables Chao Zhang1 , Tao Wei1,2∗ , Zhaofeng Chen1 , Lei Duan1 , L´aszl´o Szekeres2,3+ , Stephen McCamant2,

DocID: 1vqO6 - View Document

APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

DocID: 1vegv - View Document

Coin Flipping Cannot Shorten Arithmetic Computations Stasys Jukna Abstract. We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials.

Coin Flipping Cannot Shorten Arithmetic Computations Stasys Jukna Abstract. We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials.

DocID: 1v8nC - View Document

ASLR: How Robust is the Randomness? Jonathan Ganz What is Address Space Layout Randomization? ● Provides System-Level Control-Flow Integrity

ASLR: How Robust is the Randomness? Jonathan Ganz What is Address Space Layout Randomization? ● Provides System-Level Control-Flow Integrity

DocID: 1uHp5 - View Document