• No results found

memory-efficient data structure

An Efficient Realization Structure and Synthesis of Ternary Content-Addressable Memory (TCAM) Design Based on Reversible Circuits

An Efficient Realization Structure and Synthesis of Ternary Content-Addressable Memory (TCAM) Design Based on Reversible Circuits

... the data are searched and ...The data are stored in each TCAM cell using normal SRAM ...the data is stored in the TCAM cell, match bit will be set either logic ’0’ or logic ’1’ based on whether the ...

8

Memory Efficient Kernel Approximation

Memory Efficient Kernel Approximation

... massive data sets is a major challenge due to storage and computation issues in handling large kernel matrices, that are usually ...the structure of shift-invariant kernels changes from low-rank to ...

32

Public Auditing of Dynamic Big Data Storage with Efficient High Memory Utilization and ECC Algorithm

Public Auditing of Dynamic Big Data Storage with Efficient High Memory Utilization and ECC Algorithm

... the data size increasing, can mean that the processing time will be longer than the allotted time to process the ...of data cannot be condensed (except in rare cases), the best solution is to seek out ...

7

Bazam: a rapid method for read extraction and realignment of high throughput sequencing data

Bazam: a rapid method for read extraction and realignment of high throughput sequencing data

... the efficient linear scan of standard ...in memory until the mate is encountered ...enough memory to run such that it can store these reads until their mates are encountered by the linear ...the ...

6

Key-Value-Links: A New Data Model for Developing Efficient RDMA-Based In-Memory Stores

Key-Value-Links: A New Data Model for Developing Efficient RDMA-Based In-Memory Stores

... Social Network Graph traversal is very popular on the social network. For examples, given a user, find a per- son with a given name (e.g. “John”) among his friends, his friends’ friends, and so on is a typical problem ...

10

An Efficient Tree based Data Structure for Incremental Frequent Itemset Generation

An Efficient Tree based Data Structure for Incremental Frequent Itemset Generation

... By considering the above implementation of all four methods on sample database, it is observed that number of nodes required is minimum in our proposed novel tree structure. In this implementation every node has a ...

7

Designing a resource-efficient data structure for mobile data systems

Designing a resource-efficient data structure for mobile data systems

... Designing data structures for use in mobile devices requires attention on optimising data volumes with associated benefits for data transmission, storage space and battery ...semi-structured ...

10

Dynamic Memory Efficient Frequent Pattern Growth for Data Excavation

Dynamic Memory Efficient Frequent Pattern Growth for Data Excavation

... associated data create a valuable ...parsing. Data mining techniques are designed to perform deviation detection, dependency modelling (association rule learning), clustering, classifying, regression and ...

9

Online Full Text

Online Full Text

... new data structure known as Compact Directed Acyclic Word Graph ...space-efficient data structure used in handling and analyzing repetitions in a ...of memory/space usage over ...

5

Efficient Data Recovery Techniques ON Mlc Nand Flash Memory

Efficient Data Recovery Techniques ON Mlc Nand Flash Memory

... This scheme uses the spare area classified into three parts: ECC part, mapping information, and reserved. This method is called SoPM (Scheme based on Page-level Mapping). Each page has a Logical Page Number (LPN) and the ...

6

Efficient Partitioning of Memory Systems and Its Importance for Memory Consolidation

Efficient Partitioning of Memory Systems and Its Importance for Memory Consolidation

... initial memory trace becomes stronger, but the memory lifetimes Figure ...specific memory because it has only two ...the memory that is ...a memory is defined as the correlation between ...

13

An Efficient Framework and Techniques of Data Deduplication in Data Center

An Efficient Framework and Techniques of Data Deduplication in Data Center

... Cryptographic signatures are created for security purpose. The 160-bit value created by SHA-1 is different for each set of data. Here it breaks the data in to chunks. These chunks are either fixed or ...

5

Memory Structure and Cognitive Maps

Memory Structure and Cognitive Maps

... Is this use of space merely a helpful metaphor, or is event structure genuinely spatial-isomorphic? One genuine isomorphism comes from the local structure of both representations. That is, a ubiquitous ...

30

Investigating the structure of semantic memory.

Investigating the structure of semantic memory.

... the data produced by his method and experimental RT ...the data were optimized to best match established ambiguity norms, a variable th at has previously been shown to affect RT in ...the data to ...

73

On memory and I/O efficient duplication detection for multiple self-clean data sources

On memory and I/O efficient duplication detection for multiple self-clean data sources

...  Query Language and Query Optimization  Multidatabases and Federated Databases  Security and Integrity Maintenance  Data Mining and Knowledge Discovery  Statistical and Scientific Databases  Parallel and ...

23

1965 11 #27 Part 2 pdf

1965 11 #27 Part 2 pdf

... To satisfy these requirements, the system should include dynamic memory allocation, alternate forms of data structure, and a data management and transfer mechanism so that the same data [r] ...

199

A Search Algorithm and Data Structure for an Efficient Information System

A Search Algorithm and Data Structure for an Efficient Information System

... A SEARCH ALGORITHM AND DATA STRUCTURE FOR AN EFFICIENT INFORMATION SYSTEM A SEARCH ALGORITHM AND DATA STRUCTURE FOR AN EFFICIENT INFORMATION SYSTEM by Shou ehuan Yang Data and Computation Center Unive[.] ...

48

Implementing Lock Free Data Structure for Shared Memory Systems using Linked List

Implementing Lock Free Data Structure for Shared Memory Systems using Linked List

... Another solution to the challenges is the introduction of back_link pointers, similar to the ones proposed by Valois [10]. This is then used to replace the mark bits, so that the successor field consists of a right ...

6

Load Balancing in Cloud Computing using Ant Colony Optimization

Load Balancing in Cloud Computing using Ant Colony Optimization

... of data stored on cloud and multiple requests come for resources, due to this increase load on data servers and sometimes unable to provide resources on ...on data center and distributes it by taking ...

6

Self Buffer Management for Effective Utilization of Memory Power Consumption for Wireless Sensor Networks

Self Buffer Management for Effective Utilization of Memory Power Consumption for Wireless Sensor Networks

... Flash Memory Management in Virtual Memory System”, which revisits the design of virtual memory system using flash memory for many portable devices due to its improvements in storage capacity, ...

7

Show all 10000 documents...

Related subjects