<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Computing / Source code / Type theory / Holism / Subroutine / University of Cambridge Computer Laboratory / Macro / Constant / Variable / HindleyMilner type system
Date: 2016-08-17 18:18:26
Software engineering
Computer programming
Computing
Source code
Type theory
Holism
Subroutine
University of Cambridge Computer Laboratory
Macro
Constant
Variable
HindleyMilner type system

TRANSFORMING MULTIPLE-RECORD DATA INTO SINGLE-RECORD FORMAT WHEN NUMBER OF VARIABLES IS LARGE. David Izrael, Abt Associates Inc., Cambridge, MA David Russo, Independent Consultant ABSTRACT In one large survey project eac

Add to Reading List

Source URL: www.ats.ucla.edu

Download Document from Source Website

File Size: 37,54 KB

Share Document on Facebook

Similar Documents

Human behavior / Violence / Abuse / Crimes / Rape / Violence against women / Sexual abuse / Domestic violence / Sexual assault / Address confidentiality program / Stalking

Survivors of assault and abuse often live in constant fear. Their days are filled with anxiety, knowing that their abuser or attacker might strike again. Sadly, this is a scenario many Iowans face every day. More than 3,

DocID: 1xVMJ - View Document

S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing

S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing

DocID: 1xUA8 - View Document

Efficient, Constant-Round and Actively Secure MPC:  Beyond the Three-Party Case

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case

DocID: 1xUoQ - View Document

CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

DocID: 1xUb2 - View Document