Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 212,420,668 papers from all fields of science
Search
Sign In
Create Free Account
DSPACE
Known as:
Deterministic space
, SPACE(f(n))
, Multi-string Turing machine with input and output
Expand
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Algorithm
Algorithmic efficiency
Analysis of algorithms
Complexity class
Expand
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
Ping Chi
,
Shuangchen Li
,
+5 authors
Yuan Xie
International Symposium on Computer Architecture
2016
Corpus ID: 52824162
Processing-in-memory (PIM) is a promising solution to address the “memory wall” challenges for future computer systems. Prior…
Expand
Highly Cited
2009
Highly Cited
2009
Time series shapelets: a new primitive for data mining
Lexiang Ye
,
Eamonn J. Keogh
Knowledge Discovery and Data Mining
2009
Corpus ID: 5144823
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly…
Expand
Highly Cited
2007
Highly Cited
2007
Toward accurate dynamic time warping in linear time and space
S. Salvador
,
P. Chan
Intelligent Data Analysis
2007
Corpus ID: 12309041
Dynamic Time Warping (DTW) has a quadratic time and space complexity that limits its use to small time series. In this paper we…
Expand
Highly Cited
2006
Highly Cited
2006
Control of permanent-magnet generators applied to variable-speed wind-energy systems connected to the grid
M. Chinchilla
,
S. Arnaltes
,
J. Burgos
IEEE transactions on energy conversion
2006
Corpus ID: 23402272
Wind energy is a prominent area of application of variable-speed generators operating on the constant grid frequency. This paper…
Expand
Highly Cited
2001
Highly Cited
2001
Derivative Dynamic Time Warping
Eamonn J. Keogh
,
M. Pazzani
SDM
2001
Corpus ID: 6611383
Time series are a ubiquitous form of data occurring in virtually every scientific discipline. A common task with time series data…
Expand
Highly Cited
2000
Highly Cited
2000
Social Research Methods: Qualitative and Quantitative Approaches
H. Bernard
2000
Corpus ID: 60990606
Part I: Background to Research Chapter 1. About Social Science Chapter 2. The Foundations of Social Research Chapter 3. Preparing…
Expand
Highly Cited
1996
Highly Cited
1996
The space complexity of approximating the frequency moments
N. Alon
,
Y. Matias
,
M. Szegedy
Symposium on the Theory of Computing
1996
Corpus ID: 1627911
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…
Expand
Highly Cited
1996
Highly Cited
1996
Introduction to the Theory of Computation
M. Sipser
SIGA
1996
Corpus ID: 1283590
From the Publisher: Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and…
Expand
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…
Expand
Highly Cited
1976
Highly Cited
1976
The Polynomial-Time Hierarchy
L. Stockmeyer
Theoretical Computer Science
1976
Corpus ID: 42504471
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)
ACCEPT & CONTINUE