A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Tree-like hierarchical associative memory structures
2011
Neural Networks
Preserved Fulltext
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. ...
Instead of modelling the network as a single layer of neurons we suggest a hierarchical organization where the information content of each memory is a successive approximation of one another. ...
A tree-like hierarchical associative memory structure with R = 2 and a 1 = 2 during the retrieval process. ...
doi:10.1016/j.neunet.2010.09.012
pmid:20970304
fatcat:qtuqo5bcc5d4hjs72ycr7mhrsq
Accelerated Distance Computation with Encoding Tree for High Dimensional Data
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We avoid excessive computations by storing the encodings on an Encoding Tree(E-Tree), interestingly the memory consumption is also lowered. ...
E-Tree and E-Forest is compatible with various existing quantization-based methods. ...
Distance computation with Hierarchical Memory Structure require total O(N + P ) computations. Distance computing with Hierarchical Memory Structure requires very few memory. ...
arXiv:1509.05186v2
fatcat:5kkf23pzcnae7mbglbabrxzj4u
Efficient Sorting and Searching in Rendering Algorithms
[article]
2006
Eurographics State of the Art Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In the proposed tutorial we would like to highlight the connection between rendering algorithms and sorting and searching as classical problems studied in computer science. ...
We will present the underlying data structures and their enhancements in the context of specific rendering algorithms such as ray shooting, photon mapping, and hidden surface removal. ...
Acknowledgements We would like to thank Robert Herzog, Jaroslav Křivánek, Michael Wimmer, Peter Wonka, Tommer Leyvand, David Luebke, and Hansong Zhang for providing us various materials used in the tutorial ...
doi:10.2312/egt.20061061
fatcat:nhf62nzo2jczbhksy3h7oywrs4
Creating knowledge maps using Memory Island
2016
International Journal on Digital Libraries
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We would like to discuss with the Information Retrieval community about interactive functions such as searching. ...
Memory Islands is our work on progress visualization technique, which was inspired by the ancient "Art of Memory". ...
Acknowledgments We would like to thank Mihnea Tufis of Lip6 for his valuable comments and suggestions for improving this paper. ...
doi:10.1007/s00799-016-0196-0
fatcat:2k6m7h7clrd7xcbwol336a4oci
Distributed Tree Structure for Composite Physical Objects
2014
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We have envisaged the leaves of the tree as real physical entities and the remaining nodes as virtual ones to build a hierarchical structure. ...
We have presented a hierarchical model where its structural information could be distributed and stored into the leaf nodes. ...
Hence it should be ensured that enough space is available to store the tree structure information to the memory associated to the physical leaves. ...
doi:10.1016/j.procs.2014.05.464
fatcat:uvuyox7hhbfgvkkbuw6onvpw44
A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers
2014
2014 43rd International Conference on Parallel Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Even if a uniform runtime system is used underneath, scheduling multiple parallel tasks over the same set of hardware resources introduces many issues, such as undesirable cache flushes or memory bus contention ...
Our approach consists in capturing the parallel structure of the application in a hierarchical manner and projecting it on an abstract tree. ...
Further on, we evaluate the behavior of the hierarchical contexts approach to structure the parallelism of different problems. ...
doi:10.1109/icpp.2014.57
dblp:conf/icpp/HugoGWN14
fatcat:chugulbzhfd7xgv5vnongaoi3e
A simplified computational memory model from information processing
2016
Scientific Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The model, called simplified memory information retrieval network (SMIRN), is a bimodular hierarchical functional memory network by abstracting memory function and simulating memory information processing ...
The theoretical analysis and the simulation results show that the model is in accordance with the memory phenomena from information processing view. and have a detailed introduction to memory modeling ...
Sacramento 17 used a hierarchical structure to connect the neuron to improve the retrieval efficiency, and set up a tree associative memory network. ...
doi:10.1038/srep37470
pmid:27876847
pmcid:PMC5120294
fatcat:uvp6nvmnw5cjfdpzej2z2zko3e
Large XML Document Manager and Visualizer
[article]
2003
Eurographics State of the Art Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
It relies on a geometrical model that combines hierarchical and sequential representations. In this interface, XML structures are displayed on an inclined plane in a 3D environment. ...
Document browsing is facilitated through display space optimization and direct manipulation of document structures. ...
Acknowledgements We would like to acknowledge Stéphanie Buisine and Frédéric Vernier for their helpful advice. ...
doi:10.2312/egp.20031023
fatcat:fliv4bc53barvipdwfnsawu7zy
Efficient representation and analysis of triangulated terrains
2017
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL'17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
structures. ...
Terrain trees combine a minimal encoding of the connectivity of the underlying triangle mesh with a hierarchical spatial index, implicitly representing the topological relations among vertices, edges and ...
The Terrain tree requires from 10% to 15% extra memory to generate and encode the hierarchical structure. ...
doi:10.1145/3139958.3140050
dblp:conf/gis/FellegaraIF17
fatcat:dp3h4syksfhndpm7capylhos74
HCCMeshes: Hierarchical-Culling oriented Compact Meshes
2010
Computer graphics forum (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, BVHs may require a very large amount of memory space, which can negate the benefits of using BVHs. ...
At runtime, o-HCCMeshes are fetched from an external drive and decompressed to the i-HCCMeshes stored in main memory. ...
Acknowledgments We would like to thank Christian Lauterbach and anonymous reviewers for their constructive feedbacks. We also thank members of KAIST SGLab. for their helpful feed- ...
doi:10.1111/j.1467-8659.2009.01599.x
fatcat:4wylp4snq5dabk7cpestfbnciq
Highly Efficient Controlled Hierarchical Data Reduction techniques for Interactive Visualization of Massive Simulation Data
2019
Eurographics Conference on Visualization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We discuss how algorithms (filters) should be designed to take advantage of tree-like data structures for both data filtering or rendering. ...
In this work, we show how TB-AMR data structures could lead to more efficient exploration of massive data sets in the Exascale era. ...
Tree-Based AMR data structure A TB-AMR data structure is generally represented as a tree, where each node can be refined by a fixed factor where details are needed. ...
doi:10.2312/evs.20191167
dblp:conf/vissym/DuboisL19
fatcat:73dijpnthfhhjgc2ljwlgv4bdu
HCCMeshes
2010
ACM SIGGRAPH 2010 Posters on - SIGGRAPH '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, BVHs may require a very large amount of memory space, which can negate the benefits of using BVHs. ...
At runtime, o-HCCMeshes are fetched from an external drive and decompressed to the i-HCCMeshes stored in main memory. ...
Acknowledgments We would like to thank Christian Lauterbach and anonymous reviewers for their constructive feedbacks. We also thank members of KAIST SGLab. for their helpful feed- ...
doi:10.1145/1836845.1836997
dblp:conf/siggraph/KimBKMLY10
fatcat:y7ouw6nnqbg57j4f3kubfg22va
Aging, memory, and nonhierarchical energy landscape of spin jam
2016
Proceedings of the National Academy of Sciences of the United States of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The spin glass state found in dilute magnetic alloys has been an exceptionally convenient laboratory frame for studying complex dynamics resulting from a hierarchical energy landscape with rugged funnels ...
Our results illustrate that the memory effects can be used to probe different slow dynamics of glassy materials, hence opening a window to explore their distinct energy landscapes. ...
The pronounced memory effects found in CuMn2% may hint at an energy landscape with a more hierarchical structure. ...
doi:10.1073/pnas.1608057113
pmid:27698141
pmcid:PMC5081640
fatcat:ssabwdbapfggbmv5cvg7ppeqiq
Non-Boolean associative architectures based on nano-oscillators
2012
2012 13th International Workshop on Cellular Nanoscale Networks and their Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this talk we examine the use of the resonance of coupled nanoscale oscillators as a primitive computational operator for associative processing and develop the architectural structures that could enable ...
N-Tree Hierarchical Architecture Assume there is a pattern set with m patterns, , , , , required to be memorized by an associative memory system. ...
Therefore, we have designed our memory as a partitioned hierarchical tree with a fixed fanout. ...
doi:10.1109/cnna.2012.6331473
fatcat:pvt6nkg3vjcdxfmmzsbvrpdbuy
Control of serial order in rapidly spoken syllable sequences
1987
Journal of Memory and Language
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experiment I supported a hierarchical coding model consisting of a tree with binary branches. ...
The binary structure of the hierarchical coding of syllable order may be based in the rhythmic patterns of speech. 'C 1987 Academic Pres. Inc. ...
All phonemes in all neighboring contexts are assumed to be stored in associative memory. ...
doi:10.1016/0749-596x(87)90116-1
fatcat:al54gptcorbnbjwlv3nhk5gbla
« Previous
Showing results 1 — 15 out of 77,698 results