In-place algorithm

Known as: Sort in-place, Inplace, In-place sorting 
In computer science, an in-place algorithm is an algorithm which transforms input using no auxiliary data structure. However a small amount of extra… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We propose a fast regression model for practical single image super-resolution based on in-place examples, by leveraging two… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The role of the hippocampus in recognition memory is controversial. Recognition memory judgments may be made using different… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The Eclipse Modeling Framework (EMF) provides modeling and code generation facilities for Java applications based on structured… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Walking-in-place techniques for locomotion in virtual environments typically have two problems that impact their usability… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Silicon nanowires have received considerable attention as transistor components because they represent a facile route toward sub… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The paper proposes a new continuous-flow mixed-radix (CFMR) fast Fourier transform (FFT) processor that uses the MR (radix-4/2… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Unlike "mainframe healthcare," personal wellness technologies can scale with the needs of an aging population. They can also… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1999
1999
An algorithm is said to operate in-place if it uses only aconstant amount of extra memory for storing local variables besidesthe… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A study by Slater, et al., [1995] indicated that naive subjects in an immersive virtual environment experience a higher… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed… (More)
Is this relevant?