Zobrazeno 1 - 10
of 131 330
pro vyhledávání: '"matching algorithm"'
Traditional global positioning systems often underperform indoors, whereas Wi-Fi has become an effective medium for various radio sensing services. Specifically, utilizing channel state information (CSI) from Wi-Fi networks provides a non-contact met
Externí odkaz:
http://arxiv.org/abs/2412.02260
The string-matching problem, ubiquitous in computer science, can significantly benefit from quantum algorithms due to their potential for greater efficiency compared to classical approaches. The practical implementation of the quantum string matching
Externí odkaz:
http://arxiv.org/abs/2411.01283
It is known since 1975 (\cite{HK75}) that maximum cardinality matchings in bipartite graphs with $n$ nodes and $m$ edges can be computed in time $O(\sqrt{n} m)$. Asymptotically faster algorithms were found in the last decade and maximum cardinality b
Externí odkaz:
http://arxiv.org/abs/2409.14849
Publikováno v:
IAENG International Journal of Applied Mathematics. Aug2024, Vol. 54 Issue 8, p1574-1580. 7p.
Autor:
Lashner, Jack, Zheng, Kaiwen, Crowley, Kevin T., Galitzki, Nicholas, Harrington, Kathleen, Nakata, Hironobu, Silva-Feaver, Max
The Simons Observatory (SO) is a ground-based cosmic microwave background experiment currently being deployed to Cerro Toco in the Atacama Desert of Chile. The initial deployment of SO, consisting of three 0.46m-diameter small-aperture telescopes and
Externí odkaz:
http://arxiv.org/abs/2407.14615
Multivariate matching algorithms "pair" similar study units in an observational study to remove potential bias and confounding effects caused by the absence of randomizations. In one-to-one multivariate matching algorithms, a large number of "pairs"
Externí odkaz:
http://arxiv.org/abs/2403.12367
Autor:
Tang, Zhenpeng1 (AUTHOR) tang.zp@outlook.com, Jiang, Yanping1 (AUTHOR) ypjiang@mail.neu.edu.cn, Yang, Feifei2 (AUTHOR) feifei.yf2009@163.com
Publikováno v:
International Transactions in Operational Research. Nov2023, Vol. 30 Issue 6, p3578-3596. 19p. 2 Charts, 4 Graphs.
Autor:
Lecroq, Thierry
String matching is the problem of finding all the occurrences of a pattern in a text. It has been intensively studied and the Boyer-Moore string matching algorithm is probably one of the most famous solution to this problem. This algorithm uses two p
Externí odkaz:
http://arxiv.org/abs/2402.16469
Autor:
Jia, Panqi, Koyuncu, A. Burakhan, Mao, Jue, Cui, Ze, Ma, Yi, Guo, Tiansheng, Solovyev, Timofey, Karabutov, Alexander, Zhao, Yin, Wang, Jing, Alshina, Elena, Kaup, Andre
The research on neural network (NN) based image compression has shown superior performance compared to classical compression frameworks. Unlike the hand-engineered transforms in the classical frameworks, NN-based models learn the non-linear transform
Externí odkaz:
http://arxiv.org/abs/2402.17487