Skip to search formSkip to main contentSkip to account menu

DSPACE

Known as: Deterministic space, SPACE(f(n)), Multi-string Turing machine with input and output 
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
AlgorithmAlgorithmic efficiencyAnalysis of algorithmsComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
PRIME: A Novel Processing-in-Memory Architecture for Neural Network Computation in ReRAM-Based Main Memory
Processing-in-memory (PIM) is a promising solution to address the “memory wall” challenges for future computer systems. Prior… 
Highly Cited
2009
Highly Cited
2009
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly… 
Highly Cited
2007
Highly Cited
2007
Toward accurate dynamic time warping in linear time and space
Dynamic Time Warping (DTW) has a quadratic time and space complexity that limits its use to small time series. In this paper we… 
Highly Cited
2006
Highly Cited
2006
Control of permanent-magnet generators applied to variable-speed wind-energy systems connected to the grid
Wind energy is a prominent area of application of variable-speed generators operating on the constant grid frequency. This paper… 
Highly Cited
2001
Highly Cited
2001
Derivative Dynamic Time Warping
Time series are a ubiquitous form of data occurring in virtually every scientific discipline. A common task with time series data… 
Highly Cited
2000
Highly Cited
2000
Social Research Methods: Qualitative and Quantitative Approaches
Part I: Background to Research Chapter 1. About Social Science Chapter 2. The Foundations of Social Research Chapter 3. Preparing… 
Highly Cited
1996
Highly Cited
1996
The space complexity of approximating the frequency moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = P n=1 m k . We consider the… 
Highly Cited
1996
Highly Cited
1996
Introduction to the Theory of Computation
From the Publisher: Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and… 
Highly Cited
1995
Highly Cited
1995
A signal processing approach to fair surface design
  • G. Taubin
  • International Conference on Computer Graphics and…
  • 1995
  • Corpus ID: 1019243
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier… 
Highly Cited
1976
Highly Cited
1976
The Polynomial-Time Hierarchy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)