Zobrazeno 1 - 10
of 13 541
pro vyhledávání: '"Yi-jun A"'
Autor:
Xue, Haoran, Ge, Yong, Cheng, Zheyu, Guan, Yi-jun, Zhu, Jiaojiao, Zou, Hong-yu, Yuan, Shou-qi, Yang, Shengyuan A., Sun, Hong-xiang, Chong, Yidong, Zhang, Baile
Publikováno v:
Sci. Adv. 10, eadp0377 (2024)
Spin and valley are two fundamental properties of electrons in crystals. The similarity between them is well understood in valley-contrasting physics established decades ago in two-dimensional (2D) materials like graphene--with broken inversion symme
Externí odkaz:
http://arxiv.org/abs/2409.11714
Industrial time-series, as a structural data responds to production process information, can be utilized to perform data-driven decision-making for effective monitoring of industrial production process. However, there are some challenges for time-ser
Externí odkaz:
http://arxiv.org/abs/2407.14214
The well-known clustering algorithm of Miller, Peng, and Xu (SPAA 2013) is useful for many applications, including low-diameter decomposition and low-energy distributed algorithms. One nice property of their clustering, shown in previous work by Chan
Externí odkaz:
http://arxiv.org/abs/2405.05132
We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is the source and the destination of at most $\deg(v)$ tokens. They deve
Externí odkaz:
http://arxiv.org/abs/2405.03908
In this paper, we present new algorithms for approximating All-Pairs Shortest Paths (APSP) in the Congested Clique model. We present randomized algorithms for weighted undirected graphs. Our first contribution is an $O(1)$-approximate APSP algorithm
Externí odkaz:
http://arxiv.org/abs/2405.02695
We revisit the classic broadcast problem, wherein we have $k$ messages, each composed of $O(\log{n})$ bits, distributed arbitrarily across a network. The objective is to broadcast these messages to all nodes in the network. In the distributed CONGEST
Externí odkaz:
http://arxiv.org/abs/2404.12930
Recently, \citeauthor*{akbari2021locality}~(ICALP 2023) studied the locality of graph problems in distributed, sequential, dynamic, and online settings from a {unified} point of view. They designed a novel $O(\log n)$-locality deterministic algorithm
Externí odkaz:
http://arxiv.org/abs/2312.01384
In this work we consider the HYBRID model of distributed computing, introduced recently by Augustine, Hinnenthal, Kuhn, Scheideler, and Schneider (SODA 2020), where nodes have access to two different communication modes: high-bandwidth local communic
Externí odkaz:
http://arxiv.org/abs/2311.09548
Autor:
Chang, Yi-Jun
We consider locally checkable labeling LCL problems in the LOCAL model of distributed computing. Since 2016, there has been a substantial body of work examining the possible complexities of LCL problems. For example, it has been established that ther
Externí odkaz:
http://arxiv.org/abs/2311.06726
Autor:
Luo, Fu-Ya, Liu, Shu-Lin, Cao, Yi-Jun, Yang, Kai-Fu, Xie, Chang-Yong, Liu, Yong, Li, Yong-Jie
Stable imaging in adverse environments (e.g., total darkness) makes thermal infrared (TIR) cameras a prevalent option for night scene perception. However, the low contrast and lack of chromaticity of TIR images are detrimental to human interpretation
Externí odkaz:
http://arxiv.org/abs/2310.15688