- Home
- Mathematics
- Probability & Statistics
- Foundations of Statistical Algorithms (With References to R Packages)
Foundations of Statistical Algorithms (With References to R Packages)
List Price:
$89.99
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Claus Weihs, Olaf Mersmann, Uwe Ligges
Format:
Paperback
Pages:
500
Publisher:
CRC Press (June 19, 2019)
Language:
English
Audience:
Professional and scholarly
ISBN-13:
9780367379094
Weight:
26.875oz
Dimensions:
6.125" x 9.1875"
File:
TAYLORFRANCIS-TayFran_260403050946149-20260403.xml
Folder:
TAYLORFRANCIS
List Price:
$89.99
Country of Origin:
United States
Series:
Chapman & Hall/CRC Computer Science & Data Analysis
Case Pack:
10
As low as:
$85.49
Publisher Identifier:
P-CRC
Discount Code:
H
Pub Discount:
30
Imprint:
Chapman and Hall/CRC
Overview
Reviewing the historical development of basic algorithms to illuminate the evolution of today’s more powerful statistical algorithms, this comprehensive textbook emphasizes recurring themes in all statistical algorithms including computation, assessment and verification, iteration, intuition, randomness, repetition and parallelization, and scalability. Unique in scope, it touches on topics not usually covered in similar books, namely, systematic verification and the scaling of many established techniques to very large databases. Broadly accessible, it offers examples, exercises, and selected solutions in each chapter as well as access to a supplementary website.
