0
Your cart

Your cart is empty

Books > Computing & IT > Computer software packages > Other software packages > Mathematical & statistical software

Buy Now

Sampling Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2006) Loot Price: R3,028
Discovery Miles 30 280
Sampling Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2006): Yves Tille

Sampling Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2006)

Yves Tille

Series: Springer Series in Statistics

 (sign in to rate)
Loot Price R3,028 Discovery Miles 30 280 | Repayment Terms: R284 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Over the last few decades, important progresses in the methods of sampling have been achieved. This book draws up an inventory of new methods that can be useful for selecting samples. Forty-six sampling methods are described in the framework of general theory. The algorithms are described rigorously, which allows implementing directly the described methods. This book is aimed at experienced statisticians who are familiar with the theory of survey sampling.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Springer Series in Statistics
Release date: November 2010
First published: 2006
Authors: Yves Tille
Dimensions: 235 x 155 x 12mm (L x W x T)
Format: Paperback
Pages: 216
Edition: Softcover reprint of hardcover 1st ed. 2006
ISBN-13: 978-1-4419-2155-0
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Social sciences > Sociology, social studies > Social research & statistics > General
Books > Computing & IT > Computer software packages > Other software packages > Mathematical & statistical software
LSN: 1-4419-2155-9
Barcode: 9781441921550

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners