Results 91 to 100 of about 23,885 (296)
Linear Hashing Is Awesome [PDF]
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016 We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected length of the longest chain is $\tilde{O}\!\left(n^{1/3}\right)$.
openaire +7 more sources
Canadian Journal of Statistics, EarlyView.Abstract Homogeneous normalized random measures with independent increments represent a broad class of Bayesian nonparametric priors and thus are widely used. In this article, we obtain the strong law of large numbers, the central limit theorem (CLT), and the functional central limit theorem (fCLT) of such measures when the concentration parameter a ...
Junxi Zhang, Shui Feng, Yaozhong Hu
wiley +1 more source
Clinical Pharmacology &Therapeutics, EarlyView.Risperidone is a commonly used antipsychotic for treating psychiatric illness in children and adolescents. There is a large variability in risperidone response and discontinuation rates remain high. Pharmacogenomics offers the opportunity to improve risperidone outcomes, yet studies in pediatric populations are limited.
Jack W. Staples +10 more
wiley +1 more source
Preimage Attack on Parallel FFT-Hashing
, 2008 Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multi-permutation which helps in proving its resistance to collision attacks.
Abstract Parallel +2 more
core
BadHash: Invisible Backdoor Attacks against Deep Hashing with Clean Label
, 2022 Due to its powerful feature learning capability and high efficiency, deep hashing has achieved great success in large-scale image retrieval. Meanwhile, extensive works have demonstrated that deep neural networks (DNNs) are susceptible to adversarial ...
Jin, H +6 more
core +1 more source
An Analysis of Bitstate Hashing [PDF]
Formal Methods in System Design, 1996 The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat analysis by traditional means because of their size. Since then, the technique has been included in many research verification tools, and was even adopted in some tools that are ...
openaire +3 more sources
CSR And Bank Performance: Does Institutional Ownership Matter in the Context of an Emerging Market?
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT The question of whether institutional ownership (IO) strengthens the effect of corporate social responsibility (CSR) on financial performance (FP) remains underexplored in literature. This study examines the moderating role of IO in the CSR–FP relationship within an emerging market context, drawing on the stakeholder, agency, and stewardship ...
Kwabena Agyarko Gyekye +1 more
wiley +1 more source
AN ARCHITECTURAL MODEL FOR CONTENT MANAGEMENT IN E-COMMERCE APPLICATIONS USING INTELLIGENT AGENTS
Havacılık ve Uzay Teknolojileri Dergisi, 2011 In e-Commerce applications, the size of the architecture is huge and there are too many member shops and too many customers that bring along management difficulties.
Akhan Akbulut, Güray Yılmaz
doaj
International Journal of Eating Disorders, EarlyView.ABSTRACT Objective Despite the clinical relevance of enteral and parenteral tube feeding and restraint use in anorexia nervosa (AN), national‐level data on their use have remained limited, particularly for total parenteral nutrition (TPN) and percutaneous endoscopic gastrostomy (PEG).
Hiroyasu Ino +3 more
wiley +1 more source
Advances in Electrical and Electronic Engineering, 2003 For identification of any message it is not necessary to have available all message, but it is sufficient for its autentication its hashing. Hashing is used at safe put passwords, decode keys, autentication its hashing.
Ladislav Schwartz, Dusan Trstensky
doaj