Search · four archives
Search · four archives
22 papers · ranked by Valyu relevance
Yiding Feng, Rad Niazadeh, Amin Saberi
Matching and pricing are two critical levers in two-sided marketplaces to connect demand and supply. The platform can produce more efficient matching and pricing decisions by batching the demand requests. We initiate the study of the two-stage stochastic matching problem, with or without pricing, to enable the platform…
Billy Jin, Will Ma
We study the two-stage vertex-weighted online bipartite matching problem of Feng, Niazadeh, and Saberi (SODA '21) in a setting where the algorithm has access to a suggested matching that is recommended in the first stage. We evaluate an algorithm by its robustness R, which is its performance relative to that of the…
Tristan Pollner, Amin Saberi, Anders Wikum
We study two-stage bipartite matching, in which the edges of a bipartite graph on vertices (B 1 ∪ B2, I) are revealed in two batches. In stage one, a matching must be selected from among revealed edges E ⊆ B 1 × I. In stage two, edges E θ ⊆ B 2 × I are sampled from a known distribution, and a second matching must be…
Haiming Li, Xiaorong Zhu, Hossam A. Gabbar
With the rapid development of new energy and smart technology, the demand for inter-device communication in medium-low-voltage smart distribution grids has sharply increased, leading to a surge in the variety and quantity of communication services. To meet the needs of diverse and massive communication services…
Lingyu Zhao, Xiaorong Zhu, Jianhong Cai, Jingjing Wang
With the rapid expansion of data scale, compute-intensive tasks will become a core application of 6G networks. As Unmanned Aerial Vehicle (UAV) technology advances, UAVs can assist in task offloading for mobile edge computing by collaborating to overcome individual UAV limitations in battery life and computational…
Evripidis Bampis, Bruno Escoffier, Paul Youssef
We focus on an online 2-stage problem, motivated by the following situation: consider a system where students shall be assigned to universities. There is a first round where some students apply, and a first (stable) matching M1 has to be computed. However, some students may decide to leave the system (change their…
Yiding Feng, Rad Niazadeh
In several applications of real-time matching of demand to supply in online marketplaces, the platform allows for some latency to batch the demand and improve the efficiency of the resulting matching. Motivated by these applications, we study the optimal trade-off between batching and inefficiency in the context of…
Veska Gancheva, Hristo Stoev, Clifford J. Steer
Bioinformatics is a rapidly developing field enabling scientific experiments via computer models and simulations. In recent years, there has been an extraordinary growth in biological databases. Therefore, it is extremely important to propose effective methods and algorithms for the fast and accurate processing of…
Xiaohua Xia, Haoming Xiang, Yusong Cao, Zhaokai Ge + 2 more
'James Whiting'] Imitating the visual characteristics of human eyes is one of the important tasks of digital image processing and computer vision. Feature correspondence of humanoid-eye binocular images is a prerequisite for obtaining the fused image. Human eyes are more sensitive to edge, because it contains much…
Naoki Fujita, Nicolas Chauvet, Andre Roehm, Ryoichi Horisaki + 3 more
'Aohan Li' 'Mikio Hasegawa' 'Makoto Naruse'] Generating paired sequences with maximal compatibility from a given set is one of the most important challenges in various applications, including information and communication technologies. However, the number of possible pairings explodes in a double factorial order as a…
Carolina Feher da Silva, Gaia Lombardi, Micah Edelson, Todd A. Hare
A standard assumption in neuroscience is that low-effort model-free learning is automatic and continuously employed, while more complex model-based strategies are only used when the rewards they generate are worth the additional effort. We present evidence refuting this assumption. First, we demonstrate flaws in…
Benjamin Ries, Irfan Alibay, David W H Swenson, Hannah M Baumann + 3 more
Relative binding free energy (RBFE) calculations have emerged as a powerful tool supporting ligand optimization in drug discovery. Despite many successes, the use of RBFEs can often be limited by automation problems, in particular the setup of such calculations. Atom mapping algorithms are an essential component in…
Koichi Miyamoto, Naoki Yamamoto, Yasubumi Sakakibara
We propose two quantum algorithms for a problem in bioinformatics, position weight matrix (PWM) matching, which aims to find segments (sequence motifs) in a biological sequence such as DNA and protein that have high scores defined by the PWM and are thus of informational importance related to biological function. The…
Ahsan Sanaullah, Seba Villalobos, Degui Zhi, Shaojie Zhang
Traditionally, variations from a linear reference genome were used to represent large sets of haplotypes compactly. In the linear reference genome based paradigm, the positional Burrows-Wheeler transform (PBWT) has traditionally been used to perform efficient haplotype matching. Pangenome graphs have recently been…
Jingcao Cai, Shejie Lu, Jun Cheng, Lei Wang + 2 more
Distributed scheduling is seldom investigated in hybrid flow shops. In this study, distributed two-stage hybrid flow shop scheduling problem (DTHFSP) with sequence-dependent setup times is considered. A collaborative variable neighborhood search (CVNS) is proposed to simultaneously minimize total tardiness and…
Martin Priessner, Anna Tomberg, Jon Paul Janet, Richard J. Lewis + 2 more
In the pursuit of improved compound identification and database search tasks, this study explores Heteronuclear Single Quantum Coherence (HSQC) spectra simulation and matching methodologies. HSQC spectra serve as unique molecular fingerprints, enabling a valuable balance of data collection time and information…
Rafael Muñoz-Sánchez, Iris Martínez-Salazar, José Luis González-Velarde, Yasmín Á. Ríos Solís + 1 more
'José Luis González-Velarde' 'Yasmín Á. Ríos Solís' 'Mazyar Ghadiri Nejad'] Two hybrid flow shop scheduling lines must be coordinated to assemble batches of terminated products at their last stage. Each product is thus composed of two jobs, each produced in one of the lines. The set of jobs is to be processed in a…
Ragnar Groot Koerkamp, Pesho Ivanov
Sequence alignment has been at the core of computational biology for half a century. Still, it is an open problem to design a practical algorithm for exact alignment of a pair of related sequences in linear-like time (25). We solve exact global pairwise alignment with respect to edit distance by using the A shortest…
Wataru Takahara, Ryuto Baba, Yosuke Harashima, Tomoaki Takayama + 4 more
In the field of data-driven material development, bias in a dataset often causes difficulties in building a regression model when machine learning methods are applied. One of inorganic functional materials facing such a difficulty is photocatalysts. In this study, we propose a two-stage machine learning model to…
Ragnar Groot Koerkamp
We introduce APA2, an exact global pairwise aligner with respect to edit distance. The goal of APA2 is to unify the near-linear runtime of APA on similar sequences with the efficiency of dynamic programming (DP) based methods. Like Edlib, APA2 uses Ukkonen’s band doubling in combination with Myers’ bitpacking. APA2 1)…
Sung Jong Lee, Keehyoung Joo, Sangjin Sim, Juyong Lee + 2 more
We built a method of sequence-structure alignment (called CRFalign) which improves upon a base alignment model based on HMM-HMM comparison by employing pairwise conditional random fields (pCRF) in combination with nonlinear scoring functions of structural and sequence features. The total scoring function consists of a…
Lucas B. Rocha, Said Sadique Adi, Eloi Araujo
In computational biology, mapping a sequence s onto a sequence graph G poses a significant challenge. One possible approach to tackling this problem is to find a walk p in G that spells a sequence most similar to s. This challenge is formally known as the Graph Sequence Mapping Problem (GSMP). In this paper, we delve…