Amanote Research

Amanote Research

    RegisterSign In

Sublinear Algorithms for Massive Data Sets

doi 10.2172/1113867
Full Text
Open PDF
Abstract

Available in full text

Date

September 1, 2013

Authors
Seshadhri Comandur
Publisher

Office of Scientific and Technical Information (OSTI)


Related search

Sublinear Time Algorithms

English

Data Streams and Data Synopses for Massive Data Sets (Invited Talk)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure

2019English

Sublinear Algorithms for Testing Monotone and Unimodal Distributions

2004English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Efficient Algorithms for Fast Integration on Large Data Sets From Multiple Sources

BMC Medical Informatics and Decision Making
Health PolicyHealth Informatics
2012English

A Bayesian Approach for Comparing Cross-Validated Algorithms on Multiple Data Sets

Machine Learning
Artificial IntelligenceSoftware
2015English

The Need for Low Bias Algorithms in Classification Learning From Large Data Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy