Exploring Adaptive Window Sizes for Entity Retrieval

2014 ◽  
pp. 573-578 ◽  
Author(s):  
Fawaz Alarfaj ◽  
Udo Kruschwitz ◽  
Chris Fox
Keyword(s):  
Adaptive Window ◽  
Entity Retrieval

ASR Error Correction with Augmented Transformer for Entity Retrieval

2020 ◽  
Author(s):  
Haoyu Wang ◽  
Shuyan Dong ◽  
Yue Liu ◽  
James Logan ◽  
Ashish Kumar Agrawal ◽  
...  
Keyword(s):  
Error Correction ◽  
Entity Retrieval

scholarly journals On Multi-Scalar Multiplication Algorithms for Register-Constrained Environments

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 605
Author(s):  
Da-Zhi Sun ◽  
Ji-Dong Zhong ◽  
Hong-De Zhang ◽  
Xiang-Yu Guo
Keyword(s):  
Electronic Devices ◽  
Additive Group ◽  
Fixed Number ◽  
Scalar Multiplication ◽  
Computation Cost ◽  
Public Key Cryptosystems ◽  
Adaptive Window ◽  
Computation Efficiency ◽  
Window Method ◽  
Constrained Environments

A basic but expensive operation in the implementations of several famous public-key cryptosystems is the computation of the multi-scalar multiplication in a certain finite additive group defined by an elliptic curve. We propose an adaptive window method for the multi-scalar multiplication, which aims to balance the computation cost and the memory cost under register-constrained environments. That is, our method can maximize the computation efficiency of multi-scalar multiplication according to any small, fixed number of registers provided by electronic devices. We further demonstrate that our method is efficient when five registers are available. Our method is further studied in detail in the case where it is combined with the non-adjacent form (NAF) representation and the joint sparse form (JSF) representation. One efficiency result is that our method with the proposed improved NAF n-bit representation on average requires 209n/432 point additions. To the best of our knowledge, this efficiency result is optimal compared with those of similar methods using five registers. Unlike the previous window methods, which store all possible values in the window, our method stores those with comparatively high probabilities to reduce the number of required registers.

Machine Vision Window Division on Self-Adaptation

2011 ◽  
Vol 460-461 ◽  
pp. 617-620
Author(s):  
Xiu Chen Wang
Keyword(s):  
Image Analysis ◽  
Machine Vision ◽  
Defect Detection ◽  
Actual Situation ◽  
Adaptive Window ◽  
Fabric Defect Detection ◽  
Fabric Defect ◽  
Self Adaptation ◽  
Recognition Efficiency ◽  
Division Model

Aiming at time-consuming and ineffective problem of image window division in fabric defect detection, this paper proposes a new adaptive division method after a large number of experiments. This method can quickly and exactly recognize defect feature. Firstly, a division model on adaptive window is established, secondly, the formula to anticipate generally situation of fabric image is given according to the peaks and valleys change in the model, and methods to calculate the division size and position of adaptive window are given. Finally, we conclude that the algorithm in this paper can quickly and simply select the size and position of window division according to actual situation of different fabric images, and the time of image analysis is shortened and the recognition efficiency is improved.

People and entity retrieval in implicit social networks

2011 ◽  
Author(s):  
Suman K Pathapati ◽  
Subhashini Venugopalan ◽  
Ashok Pon Kumar ◽  
Anuradha Bhamidipaty
Keyword(s):  
Social Networks ◽  
Entity Retrieval
Sign in / Sign up

Export Citation Format

Share Document