in-memory data structure
Optimal Load Factor for Approximate Nearest Neighbor Search under Exact Euclidean Locality Sensitive Hashing
... index-based data structure that allows spatial item retrieval over a large ...and memory space requirement to create and store items in this data structure ...low memory space of ...
10
Response probability and latency: a straight line, an operational definition of meaning and the structure of short term memory
... The data from Anderson (1981) is shown in Figure 1(c) where I have gone beyond Anderson by plotting all experimental data in the same graph, ...the data points below the ...the data looks ...
20
Properties of the Short Term Memory Structure
... of memory that should be ...RHW data but it is somewhat unlikely – one would not expect that a feature comparison would take that much time that it would slow down the reaction time by up to ...Sternberg ...
8
Long Memory Affine Term Structure Models
... the data for nominal yields and macro variables used for estimation of the ...yields data, namely their dynamic persistence and the shape of their volatility term structure, es- pecially for long ...
62
A high performance k-NN approach using binary neural networks
... the data structure by storing each record and its 100 nearest neighbours as a C++ ordered list of <record identifier, Euclidean distance> ...list data structure from the C++ Standard ...
38
IVEE: Interesting video event extraction
... groups data structure contains red pixel intensities, green pixel intensities, blue pixel intensities, heights, widths, times in hours since the beginning of Sunday, membership levels, the dates the groups ...
148
The Short Term Memory Structure In State-Of-The Art Recall/Recognition Experiments of Rubin, Hinton and Wentzel
... term memory structure shows a linear correlation of recall (recognition) probability with search time from 6 to 600 (350) seconds after the start of the stimulus presentation (compare with Pachella (1974), ...
17
AN INNOVATIVE TECHNIQUE IN DATA STRUCTURE TO FIND MINIMUM SPANNING TREE OF GRAPH
... Minimum spanning tree of any weighted graph is that tree whose sum of weights are least than any tree in the forest on that particular graph, because of this feature of minimum spanning tree, it can be applied to find ...
7
A new dissimilarity measure for finding semantic structure in category fluency data with implications for understanding memory organization in schizophrenia
... semantic memory for the animal category is organized relates to physical ...control data (Paulsen et ...patient data does not provide strong support for the hypothesis of a deterioration of semantic ...
55
A new dissimilarity measure for finding semantic structure in category fluency data with implications for understanding memory organization in schizophrenia
... semantic memory will be named together in fluency lists more often than items that are distantly related (see also Schwartz and Baldo, 2001, for a method of calculating item similarity based on this ...
8
Experiences in data parallel simulation and analysis of complex systems with irregular graph structures : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand
... the data structure used to store the arcs in memory is not affected and the number of incoming connections remains the same for all ...graph structure may be a good candidate to more ...
215
Implementing Lock Free Data Structure for Shared Memory Systems using Linked List
... Insertion and deletion using compare and swap during the design and implementation of lock-free data structure is of a major problem to most researchers and designers. In implementing insertion and deletion ...
6
Bazam: a rapid method for read extraction and realignment of high throughput sequencing data
... for memory use, mak- ing it impractical for use with large data ...and data structure to reduce its memory requirements and increase effi- ciency, but ultimately relies on storing reads ...
6
Memory access integrity: detecting fine-grained memory access errors in binary code
... Traditional data structure recovery is different from memory bounds recovery techniques for memory error ...Traditional data structure recovery techniques focus on restoring all ...
18
DSA 01.ppt
... In linear data structures, the data is arranged in a linear fashion through the way they are stored in memory may not be sequential.. A data structure is said to be non-linear if the[r] ...
29
Investigating the structure of semantic memory.
... (1994) data set, the GA must apply the weights to the local co-occurrence strengths calculated earlier, construct a semantic graph, apply the graph clustering algorithm, then measure the ambiguity of the ...
73
A template based methodology for efficient microprocessor and FPGA accelerator co design
... based on evolutionary Multi-Objective Optimization (MOO) is proposed to create the DP of a HW accelerator for a JPEG algorithm [15]. A generic architecture is proposed which implements the control and the DP of the ...
9
High Efficient Z TCAM Implementation Using FPGA for NIDS
... TCAM memory. It consists of hybrid partitioning of the memory which involves both horizontal partition as well as vertical ...ternary memory are processed in order to store in the corresponding ...
8
A Review on Basic Database Concepts
... the data looks to the external ...the data related to ...the data related to the Accounts ...see data related to them, such as their marks and their individual status in the ...
6
REVIEW PAPER ON IN-MEMORY COMPUTING
... of data in RAM itself, thereby allowing enterprises to address the 'volume' aspect of Big Data ...If data is processed in-memory, instead of following the 'stored-and-process' paradigm as in ...
6