Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Maximum power point trackers (MPPT) are required in order to obtain optimal photovoltaic power. To achieve this task, an… Expand
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 2
Review
2017
Review
2017
Over the past few decades, Machine Learning (ML) has evolved from the endeavour of few computer enthusiasts exploiting the… Expand
Highly Cited
2007
Highly Cited
2007
Problem: While there has been considerable attention dedicated to the development and implementation of institutional… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
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… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
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… Expand
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… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1976
Highly Cited
1976
Abstract The polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarchy in which deterministic… Expand