A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
Hierarchical affinity hybrid tree: A multidimensional index structure to organize videos and support content-based retrievals
2008
2008 IEEE International Conference on Information Reuse and Integration
Preserved Fulltext
data storage, index, and query engines need to be developed with dedicated abilities to handle the characteristics of multimedia data like multidimensional representation and semantic gap. ...
(HAH-Tree) which addresses the critical issues of multidimensionality and semantic gap. ...
Experiments In our experiments, 10 soccer videos were collected from different sources with total time duration of almost 2 hours. ...
doi:10.1109/iri.2008.4583070
dblp:conf/iri/ChatterjeeC08
fatcat:anaxc636yrccja7ehti5ypx4my
EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks
2007
27th International Conference on Distributed Computing Systems (ICDCS '07)
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 2010; you can also visit the original URL.
The file type is application/pdf.
This paper presents the design, implementation, and evaluation of EnviroMic, a novel distributed acoustic monitoring, storage, and trace retrieval system. ...
Applications of acoustic monitoring with EnviroMic range from the study of mating rituals and social behavior of animals in the wild to audio surveillance of military targets. ...
If the event continues past that interval, recording is interrupted to elect a leader and assign recording tasks both for the future and the past. ...
doi:10.1109/icdcs.2007.108
dblp:conf/icdcs/LuoCHASW07
fatcat:5q6fplexfnhv7h7ktbvqy4omsm
A Distributed Data Storage Architecture for Event Processing by Using the Globus Grid Toolkit
[chapter]
2003
Lecture Notes in 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 2003; you can also visit the original URL.
The file type is application/pdf.
Event processing and filtering is a kind of data intensive problem in high-energy physics area. ...
Meanwhile the Globus Toolkit has become the de facto standard of building high performance distributed computing environments. ...
Experiment and Results From August to October in 2002, we tested 13 groups of raw event data, and with a total of 130 experiment executions (for decreasing the effect of system and network latency in executable ...
doi:10.1007/3-540-44862-4_29
fatcat:jvcyawmmqjhshiwvgdybiab2lm
A Cognitive Model of Episodic Memory Integrated with a General Cognitive Architecture
2004
International Conference on Cognitive Modelling
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 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a framework for describing the functional stages for computational models of episodic memory: encoding, storage, retrieval and use of the retrieved memories. ...
Episodic memory provides a mechanism for accessing past experiences and has been relatively ignored in computational models of cognition. ...
Vere Basic Agent maintained a limited episodic memory of events. However, the memory did not address issues of how to search and retrieve episodes effectively and efficiently. ...
dblp:conf/iccm/NuxollL04
fatcat:lzws7orklbfzffnnsponx5ma4i
HIERARCHICAL DATA MODEL FOR STORAGE AND INDEXING OF MASSIVE STREET VIEW
2019
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
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.
Real test experiments are conducted in a project, and the validation and feasibility of 3D-Grid including time indexing algorithm were validated.</p> ...
For the massive image, data model for storage and indexing is an important research issue. ...
This study is jointly supported by the National Natural Science Foundation of China (Grant #41771412), the Beijing Natural Science Foundation (Grant #8182015), Beijing Advanced innovation center for future ...
doi:10.5194/isprs-archives-xlii-2-w13-1295-2019
fatcat:57l4r6td3zbklo4whj2ueovtee
Uniscript
2004
Proceedings of the the 1st ACM workshop on Continuous archival and retrieval of personal experiences - CARPE'04
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 2011; you can also visit the original URL.
The file type is application/pdf.
We present in this paper a model of personal knowledge representation for lifetime storage. In the model we separate the knowledge layer from the resource layer. ...
The knowledge layer consists of a network of atomic knowledge units situated in space and time. ...
Another component, the storage buffer is useful to handle future stances and stances of uncertain source. ...
doi:10.1145/1026653.1026663
fatcat:gd6oqdirtjd3fh5lsqrycpuhje
The ATLAS ROOT-based data formats: recent improvements and performance measurements
2012
Journal of Physics, Conference Series
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.
Optimisations have also been made for the D3PD format. We present a full evaluation of the resulting performance improvements from these, including in the case of selected retrieval of events. ...
We detail recent changes to ROOT-based I/O within the ATLAS experiment. The ATLAS persistent event data model continues to make considerable use of a ROOT I/O backend through POOL persistency. ...
All events are accessed with a TTreeCache of 30MB. ...
doi:10.1088/1742-6596/396/2/022006
fatcat:syylo4mp6vg3nbv5hcpy774p7e
Multimedia Indexing, Search, and Retrieval in Large Databases of Social Networks
[chapter]
2012
Computer Communications and Networks
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.
In the first part pure multimedia content retrieval issues are presented, while in the second part, the social aspects and new, interesting views on multimedia retrieval in the large social media databases ...
Moreover, the diversity of the available content, inspired users to demand and formulate more complicated queries. ...
Note that the comparison with M-Tree is omitted, since M-Tree belongs to the family of exact similarity search and its retrieval accuracy is always equal to 100%. ...
doi:10.1007/978-1-4471-4555-4_3
dblp:series/ccn/SemertzidisRTSD13
fatcat:6l3whv5qcjgshmjwcqh6dgelb4
Theoretical and empirical review of multinomial process tree modeling
1999
Psychonomic Bulletin & Review
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.
In the conclusion, we consider the current role of MPT models in psychological research and possible future directions. ...
We review a current and popular class of cognitive models called multinomial processing tree (MPT) models. ...
in which storage and retrieval both increase with age but with stronger changes for storage (e.g., Brainerd et aI., 1990, Experiment 2; Howe, 1995) . ...
doi:10.3758/bf03210812
pmid:12199315
fatcat:b6pzlzvxbvhmvdiikwaeelnta4
Episodic Memory in a Cognitive Model
2016
International Conference on Case-Based Reasoning
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.
Then we discuss three architectural implications of the new capability and list some future work before we conclude. ...
The ability to remember events plays an important role in human life. People can replay past events in their heads and often make decisions based on the retrieved information. ...
This hierarchy, illustrated in Figure 1 , provides an interesting indexing scheme for the retrieval and storage of episodes. ...
dblp:conf/iccbr/Menager16
fatcat:srt3ivr2kfgp5putuqhfvs4d5u
A retrieval technique for high-dimensional data and partially specified queries
2002
Data & Knowledge Engineering
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 2006; you can also visit the original URL.
The file type is application/pdf.
This indexing mechanism is a general-purpose point access method that effectively attacks the limitations of KDB-trees in spaces with many dimensions, while preserving the simplicity and relatively good ...
The analytical and experimental results show that the new indexing scheme outperforms two other variants of KDB-trees investigated in the paper for both fully and partially specified queries. Ó ...
As we expected, for very small x, there is a rather severe tradeoff between the storage and retrieval performance of KDB TV -trees. ...
doi:10.1016/s0169-023x(02)00023-x
fatcat:np7s4ruj7zhq5lq7vaypyrvzyi
Let's get our hands dirty: a comprehensive evaluation of DAQDB, key-value store for petascale hot storage
2020
EPJ Web of Conferences
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 2021; you can also visit the original URL.
The file type is application/pdf.
The DAQ is a complex distributed computing system and coordinates all operations, from the data selection stage of interesting events to storage elements. ...
Furthermore, we complement our study with a description of the challenges faced and the lessons learned while integrating DAQDB with the existing software framework of the ATLAS experiment. ...
whereas nCL is the number of collector threads working in parallel with the readout threads and using GetAny feature for next event retrieval. ...
doi:10.1051/epjconf/202024510004
fatcat:6ebydien4fgp3dk32zivvlu3fm
Clustering of search results using temporal attributes
2006
Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '06
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.
Clustering of search results is an important feature in many of today's information retrieval applications. ...
The notion of hit list clustering appears in Web search engines and enterprise search engines as a mechanism that allows users to further explore the coverage of a query. ...
For indexing and storage, we use Oracle Text because of the combination of text and XML searching. ...
doi:10.1145/1148170.1148273
dblp:conf/sigir/AlonsoG06
fatcat:e6jv6dda5fftzagigzffzb7ybi
A multinomial modeling analysis of the mnemonic benefits of bizarre imagery
1992
Memory & Cognition
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.
To determine ifthese differences were due to the storage or retrieval of the items, a multinomial model for the analysis of imagery mediation in paired-aseociate learning was developed and applied to the ...
The model revealed that bizarre sentences benefited the retrieval of the noun pairs but not their storage within memory. ...
Figure I presents the tree diagram for the current model, and from this tree structure it is easy to write expressions for the probabilities of each data event: P(E I ) = arlr20 (1a) P(E 2 ) = a(1-rl) ...
doi:10.3758/bf03202710
pmid:1435263
fatcat:ysvydemstnhkdpgg7ki6bg7cba
Close pair queries in moving object databases
2005
Proceedings of the 2005 international workshop on Geographic information systems - GIS '05
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 2006; you can also visit the original URL.
The file type is application/pdf.
The retrieval component takes advantage of a new index mechanism, the Multiple TSB-tree. The segments are then pipelined to the close-pair identification component. ...
This paper solves the range close-pair query using two components: the retrieval component and the close-pair identification component. ...
The range close-pair query is important in real-life applications, but it has not been studied before. We propose a storage scheme (Multiple TSB-tree) and a retrieval method based on the MTSB-tree. ...
doi:10.1145/1097064.1097067
dblp:conf/gis/ZhouZSCK05
fatcat:pm7g6xyg2rb4lhfr75p5ci23ji
« Previous
Showing results 1 — 15 out of 39,308 results