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.
Filters
Accelerating instant question search with database techniques
2011
Proceedings of the 20th international conference companion on World wide web - WWW '11
Preserved Fulltext
A question database is semantically analyzed and searched in the semantic space by boosting the performance of similarity searches with database techniques such as server/client caching and LSH (Locality ...
Sensitive Hashing). ...
Since the semantic smoothing model used in this paper is fully static, it is a more practical approach to employ recently proposed incremental model [8] for a wholly dynamic and autonomous incremental ...
doi:10.1145/1963192.1963290
dblp:conf/www/EdaUBKCK11
fatcat:k43wwxmbpfe5tm4iax5bmqcoie
Continual learning using hash-routed convolutional neural networks
[article]
2020
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.
We introduce hash-routed convolutional neural networks: a group of convolutional units where data flows dynamically. ...
A continual learning model needs to scale efficiently to handle semantically different datasets, while avoiding unnecessary growth. ...
Section 3 details the hash-routing algorithm and discusses its key attributes. Section 4 compares our work with other continual learning and dynamic network studies. ...
arXiv:2010.05880v1
fatcat:ttg6lggo3rgs5ikegkwcryuoca
Dynamic Incremental Hashing in Program Model Checking
2006
Electronical Notes in Theoretical 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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we introduce incremental hashing on large, dynamically changing state vectors that naturally arise during the verification of software in program model checkers. ...
Based on the changes in the predecessor state, the new state and its hash value can be computed efficiently. ...
with dynamically changing state vectors. ...
doi:10.1016/j.entcs.2005.07.026
fatcat:lahlvqclnnfwjkpyfv4bkqh7tq
Data Deduplication Technology for Cloud Storage
2020
Tehnički Vjesnik
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.
With the explosive growth of information data, the data storage system has stepped into the cloud storage era. ...
In the end of the paper, we test the disk utilisation and the file upload performance on RFD-HDFS and FD-HDFS, and compare HDFS with the disk utilisation of two system frameworks. ...
by comparing file contents with the same hash value; (4) if the contents of the files are the same, the data will be deduplicated; if not, the files will be stored in the storage pool for the next hash ...
doi:10.17559/tv-20200520034015
fatcat:7nux46ma5fgmvapqcq6vlhynd4
MJoin
2003
Proceedings of the 2nd international workshop on Distributed event-based systems - DEBS '03
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.
Hence, the join execution logic defined statically before runtime may not be well suited to deal with varying types of dynamic runtime scenarios. ...
Recently, stream join algorithms, like Symmetric Hash Join and XJoin, have been designed to perform in a pipelined fashion to cope with the latent delivery of data. ...
DISK
Waiting
Tuple Pool
Punctuation
Collection
Hash Buckets
Hash Buckets
Waiting
Tuple Pool
Punctuation
Collection
Hash Buckets
Hash Buckets
State of Stream A
State of Stream B ...
doi:10.1145/966637.966639
fatcat:5bizizwa5zfynczgutxzixp6ay
MJoin
2003
Proceedings of the 2nd international workshop on Distributed event-based systems - DEBS '03
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.
Hence, the join execution logic defined statically before runtime may not be well suited to deal with varying types of dynamic runtime scenarios. ...
Recently, stream join algorithms, like Symmetric Hash Join and XJoin, have been designed to perform in a pipelined fashion to cope with the latent delivery of data. ...
DISK
Waiting
Tuple Pool
Punctuation
Collection
Hash Buckets
Hash Buckets
Waiting
Tuple Pool
Punctuation
Collection
Hash Buckets
Hash Buckets
State of Stream A
State of Stream B ...
doi:10.1145/966618.966639
dblp:conf/debs/DingRH03
fatcat:3n5wtifiszbibknldkuszxlfom
DDoS Attack and Interception Resistance IP Fast Hopping Based Protocol
[article]
2014
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 2019; you can also visit the original URL.
The file type is application/pdf.
We describe a method of dynamic server IP address change and all modules necessary to implement the approach. ...
The mapping of the real IP address on one of "virtual" is unique for each communication session and changes dynamically every millisecond. ...
As the result, from the point of view of an external observer of the client-server communication session, the IP address of the server is changing regularly to a random address with each increment of timestamps ...
arXiv:1403.7371v1
fatcat:qvlqi76tibhsng5vxbnsxguvmy
Deep Progressive Hashing for Image Retrieval
2017
Proceedings of the 2017 ACM on Multimedia Conference - MM '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 2019; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a novel recursive hashing scheme, in contrast to conventional one-off based hashing algorithms. ...
The proposed deep hashing network is trained via minimizing a triplet ranking loss, which is end-to-end trainable. ...
They add max pooling after the convolutional layers with 1 × 1 kernel and replace the fully-connected layer with average pooling. ...
doi:10.1145/3123266.3123280
dblp:conf/mm/BaiNWSLZMHY17
fatcat:zmcavxe6bzcu5dtr4kkyqetnxu
A Cloud Service Model Based on Indirect Addressing
2015
International Journal of Hybrid Information Technology
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.
The case studies proved the method with some advantages, and it proposes a new way to resolve the service problem in cloud. ...
Fayyas U M and Smyth P research on the knowledge acquisition technologies based on the incremental dynamic database knowledge [13] , Tsumoto S and Tanaka H proposed a Bayesian classifier to settle the ...
4 parameters:
resource storage node with the minimum hash value, the index range is composed by it and the end router _ node. end router _ is the specified resource storage node with the maximum hash ...
doi:10.14257/ijhit.2015.8.5.26
fatcat:duzef7hxhrarhh25uf7bnoceq4
A Secure Framework for Authentication of Documents in Cloud
2018
Helix
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 order to overcome the setbacks, it is proposed a methodology with the stored data processing of encoding and decoding at cloud environment taking the support of cryptographic hash values. ...
It is explained how the documents can be processed using cloud computing environment where the application is integrated with Hadoop installed on Amazon EC2 web service. ...
in the amount of data that has been stored, processed and reported .All professionals are confronted with novel challenges and unexpected opportunities even as they come to grips with the changing dynamics ...
doi:10.29042/2018-3406-3412
fatcat:cx7flk45wrb5vju4jus4i3qsve
Implementing hash-consed structures in Coq
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We report on three different approaches to use hash-consing in programs certified with the Coq system, using binary decision diagrams (BDD) as running example. ...
In typical implementations, this pool is a global hash table. ...
Introduction Hash-consing is an implementation technique for immutable data structures that keeps a single copy, in a global hash table, of semantically equivalent objects, giving them unique identifiers ...
arXiv:1304.6038v1
fatcat:wxvcwzn33vd4dbbvhfiexmjhme
Implementing Hash-Consed Structures in Coq
[chapter]
2013
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 2017; you can also visit the original URL.
The file type is application/pdf.
We report on three different approaches to use hash-consing in programs certified with the Coq system, using binary decision diagrams (BDD) as running example. ...
In typical implementations, this pool is a global hash table. ...
Introduction Hash-consing is an implementation technique for immutable data structures that keeps a single copy, in a global hash table, of semantically equivalent objects, giving them unique identifiers ...
doi:10.1007/978-3-642-39634-2_36
fatcat:gljdvzgtu5ahtd2rsjg67smhjy
Dynamic Query-Based Debugging
[chapter]
1999
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 2017; you can also visit the original URL.
The file type is application/pdf.
To speed up dynamic query evaluation, our debugger (implemented in portable Java) uses a combination of program instrumentation, load-time code generation, query optimization, and incremental reevaluation ...
Dynamic query-based debuggers offer programmers an effective tool that provides instant error alert by continuously checking inter-object relationships while the debugged program is running. ...
Overall, the experiments with non-incremental evaluation of queries show that incremental evaluation is imperative, greatly reducing the overhead and making a much larger class of dynamic queries practical ...
doi:10.1007/3-540-48743-3_7
fatcat:daguvwafbrhmrpkgxcxp4nmvlq
An Efficient Approach for Uncertain Event Detection in RFID Complex Event Processing
2021
JOIV: International Journal on Informatics 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.
The proposed method is based on the hashing and thread pool technique to solve high memory consumption, long processing time and low event throughput in the current detection approaches. ...
Detecting uncertain conditions such as counterfeit and missing items in the manufacturing environment requires a specialized set of technologies to deal with a flow of continuously created data. ...
Hash tables store data with the aid of using a technique called hashing. ...
doi:10.30630/joiv.5.4.736
fatcat:3paq57nd5bg3zhybwi7pis4h6y
OMBA: User-Guided Product Representations for Online Market Basket Analysis
[article]
2021
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2006.10396v1 fatcat:u4xomvl7v5gqnij5enyeyfuqfq
OMBA jointly learns representations for products and users such that they preserve the temporal dynamics of product-to-product and user-to-product associations. ...
Also, they have limited ability to capture temporal dynamics in associations between products. Hence, we propose OMBA, a novel representation learning technique for Online Market Basket Analysis. ...
Compute the hash value for all the products. 3. Group the products with similar hash values to construct a hash table. 4. ...
arXiv:2006.10396v2
fatcat:mov3kmp7d5etnduooyid6yfj5e
« Previous
Showing results 1 — 15 out of 2,925 results