Skip to search formSkip to main contentSkip to account menu

Random-access stored-program machine

Known as: Random access program machine, RASP machine, RASP 
In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
This paper studies the problem of finding most reliable a priori shortest paths (RASP) in a stochastic and time-dependent network… 
Highly Cited
2009
Highly Cited
2009
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data… 
Highly Cited
2007
Highly Cited
2007
This article describes a number of log-linear parsing models for an automatically extracted lexicalized grammar. The models are… 
Highly Cited
2006
Highly Cited
2006
We describe the new release of the RASP (robust accurate statistical parsing) system, designed for syntactic annotation of free… 
Highly Cited
2005
Highly Cited
2005
Data perturbation techniques are one of the most popular models for privacy preserving data mining (Agrawal and Srikant, 2000… 
Highly Cited
2004
Highly Cited
2004
This work investigates the variation in a word's distributionally nearest neighbours with respect to the similarity measure used… 
1970
1970
In this paper we explore the computational complexity measure defined by running times of programs on random access stored… 
Highly Cited
1964
Highly Cited
1964
A new class of machine models as a framework for the rational discussion of programming languages is introduced. In particular, a…