P09-2086 8K-byte block . To facilitate random access to the compressed block , we
J87-3003 Any file system that supports random access of information keyed by words
H91-1043 assumed model of computation is the Random Access Machine , taken under the uniform
P84-1010 small ( .25 M ) tapes without random access . The requirements of normal
P11-4017 size of these dumps , efficient , random access is infeasible with this approach
E91-1012 accomplished in 0 ( n2 ) time on a random access machine . Hence , the total time-complexity
J95-2004 is achieved while maintaining random access using a procedure for sparse
C69-5101 Peterson introduced this method for random access storage addressing . This method
C69-5101 device Such as a drum or disk for random access . After several updating functions
E85-1025 was sorted and converted into a random access file together with indexing information
J11-3011 Process data sequentially and avoid random access . • Hide system-level details
P83-1015 except that its working menory is random access rather than sequential . A RASP
C92-2117 minimal complete algorithm requires random access to the erstwhile stack for one
N13-1065 disk ) , it requires consistent random access to model parameters . Thus ,
M93-1016 from disk ( using hashe d index random access ) . Lexical pattern matching
A00-2036 class is an algorithm R that has random access to some data structure C ( G
P07-1065 compressed files do not support direct random access as required by our application
A83-1030 , they are still too large for random access memory technology , although
J87-3002 dictionary has been converted into a random access file , paired together with an
E87-1011 mainframe ( as long as it supported random access to files ) just as well as it
hide detail