Results 41 to 50 of about 62,184 (228)

A ranking hashing algorithm based on listwise supervision

Dianxin kexue, 2019
Recently,learning to hash technology has been used for the similarity search of large-scale data.It can simultaneous increase the search speed and reduce the storage cost through transforming the data into binary codes.At present,most ranking hashing ...
Anbang YANG, Jiangbo QIAN, Yihong DONG, Huahui CHEN   +3 more
doaj   +2 more sources

Detection Of Duplicate And Near-Duplicate Content For Web Crawlers

JISR on Computing, 2015
There is an abundance of duplicated web documents on the internet. For example, two documents online could be very similar to each other except for a very small portion, such as URLs and advertisements.
Hadi Hussain Khan, Husnain Mansoor Ali
doaj   +1 more source

Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance

IEEE Access, 2020
Hashing aims at learning discriminative binary codes of high-dimensional data for the approximate nearest neighbor searching. However, the distance ranking obtained by traditional methods is not optimum in the Hamming space, and it degrades the ...
Yufei Zha, Zhuling Qiu, Peng Zhang, Wei Huang   +3 more
doaj   +1 more source

The Power of Asymmetry in Binary Hashing [PDF]

, 2013
When approximating binary similarity using the hamming distance between short binary hashes, we show that even if the similarity is symmetric, we can have shorter and more accurate hashes by using two distinct code maps. I.e.
Makarychev, Yury, Neyshabur, Behnam, Salakhutdinov, Ruslan, Srebro, Nathan, Yadollahpour, Payman   +4 more
core   +2 more sources

Hamming Approximation of NP Witnesses [PDF]

, 2012
Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language.
Sheldon, Daniel, Young, Neal E.
core   +3 more sources

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

Molecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova, Zuzana Kozovska, Ondrej Pos, Kristina Pavlov, Sachin Gulati, Peter Makovicky, Kristina Jakic, Monika Burikova, Eva Sedlackova, Barbora Svitkova, Silvia Tyciakova, Vojtech Bystry, Nicolas Blavet, Boris Tichy, Matej Hrnciar, Jaroslav Budis, Miroslav Tomas, Peter Dubovan, Georgina Kolnikova, Veronika Repaska, Nikoleta Mojzesova, Eva Zomborska, Daniel Pindak, Michal Mego, Tomas Szemes, Miroslava Matuskova   +25 more
wiley   +1 more source

CD47 promotes mitogen‐activated protein kinase and epithelial‐to‐mesenchymal transition molecular programs to drive prometastatic phenotypes in non‐small cell lung cancer

Molecular Oncology, EarlyView.
Beyond its role in immune evasion, this study identified that CD47 drives tumor‐intrinsic signaling in non‐small cell lung cancer (NSCLC). Transcriptomic profiling and functional studies revealed that CD47 regulates cell adhesion, migration, and metastasis through an ERK–EMT signaling axis.
Asa P.Y. Lau, Lilian G. Zhai, Ryunosuke Hoshi, Zackary Rousseau, Abraam Zakhary, Yin Fang Wu, Rola M. Saleeb, Heyu Ni, Kelsie L. Thu   +8 more
wiley   +1 more source

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

Molecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura, Tadahiro Kuribayashi, Johannes Brägelmann, Sachi Okawa, Masataka Taoka, Shunta Mori, Tomoka Nishimura, Takaaki Tanaka, Go Makimoto, Kiichiro Ninomiya, Kammei Rai, Eiki Ichihara, Ryohei Katayama, Katsuyuki Hotta, Masahiro Tabata, Yosuke Togashi, Yoshinobu Maeda, Martin L. Sos, Katsuyuki Kiura, Kadoaki Ohashi   +19 more
wiley   +1 more source

Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance

Stats
This article investigates the probabilistic relationship between quantum classification of Boolean functions and their Hamming distance. By integrating concepts from quantum computing, information theory, and combinatorics, we explore how Hamming ...
Theodore Andronikos, Constantinos Bitsakos, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris   +4 more
doaj   +1 more source

Matching Patterns with Variables under Hamming Distance

CoRR, 2021
A pattern $α$ is a string of variables and terminal letters. We say that $α$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $α$ by terminal words. The matching problem, i.e., deciding whether a given pattern matches a given word, was heavily investigated: it is NP-complete in general, but ...
Pawel Gawrychowski, Florin Manea, Stefan Siemer   +2 more
openaire   +4 more sources