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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Problem: While there has been considerable attention dedicated to the development and implementation of institutional… 
Highly Cited
2007
Highly Cited
2007
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
Wind energy is a prominent area of application of variable-speed generators operating on the constant grid frequency. This paper… 
Highly Cited
2005
Highly Cited
2005
Standard SVM training has O(m3) time and O(m2) space complexities, where m is the training set size. It is thus computationally… 
Highly Cited
2001
Highly Cited
2001
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
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
From the Publisher: Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and… 
Highly Cited
1996
Highly Cited
1996
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
1995
Highly Cited
1995
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