Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Mizutani, Yosuke"'
Autor:
Bentert, Matthias, Salomao, Daniel Coimbra, Crane, Alex, Mizutani, Yosuke, Reidl, Felix, Sullivan, Blair D.
We investigate whether algorithms based on arithmetic circuits are a viable alternative to existing solvers for Graph Inspection, a problem with direct application in robotic motion planning. Specifically, we seek to address the high memory usage of
Externí odkaz:
http://arxiv.org/abs/2409.08219
The NP-hard Odd Cycle Transversal problem asks for a minimum vertex set whose removal from an undirected input graph $G$ breaks all odd cycles, and thereby yields a bipartite graph. The problem is well-known to be fixed-parameter tractable when param
Externí odkaz:
http://arxiv.org/abs/2409.00245
Autor:
Mizutani, Yosuke, Salomao, Daniel Coimbra, Crane, Alex, Bentert, Matthias, Drange, Pål Grønås, Reidl, Felix, Kuntz, Alan, Sullivan, Blair D.
Autonomous robotic inspection, where a robot moves through its environment and inspects points of interest, has applications in industrial settings, structural health monitoring, and medicine. Planning the paths for a robot to safely and efficiently
Externí odkaz:
http://arxiv.org/abs/2407.00251
Autor:
Ajwani, Deepak, Bisseling, Rob H., Casel, Katrin, Çatalyürek, Ümit V., Chevalier, Cédric, Chudigiewitsch, Florian, Faraj, Marcelo Fonseca, Fellows, Michael, Gottesbüren, Lars, Heuer, Tobias, Karypis, George, Kaya, Kamer, Lacki, Jakub, Langguth, Johannes, Li, Xiaoye Sherry, Mayer, Ruben, Meintrup, Johannes, Mizutani, Yosuke, Pellegrini, François, Petrini, Fabrizio, Rosamond, Frances, Safro, Ilya, Schlag, Sebastian, Schulz, Christian, Sharma, Roohani, Strash, Darren, Sullivan, Blair D., Uçar, Bora, Yzelman, Albert-Jan
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final application c
Externí odkaz:
http://arxiv.org/abs/2310.11812
Autor:
Mizutani, Yosuke, Sullivan, Blair D.
We present fixed-parameter tractable (FPT) algorithms for two problems, Maximum Happy Set (MaxHS) and Maximum Edge Happy Set (MaxEHS)--also known as Densest k-Subgraph. Given a graph $G$ and an integer $k$, MaxHS asks for a set $S$ of $k$ vertices su
Externí odkaz:
http://arxiv.org/abs/2207.06623
Mining groups of genes that consistently co-express is an important problem in biomedical research, where it is critical for applications such as drug-repositioning and designing new disease treatments. Recently, Cooley et al. modeled this problem as
Externí odkaz:
http://arxiv.org/abs/2206.07286
A primary challenge in metagenomics is reconstructing individual microbial genomes from the mixture of short fragments created by sequencing. Recent work leverages the sparsity of the assembly graph to find $r$-dominating sets which enable rapid appr
Externí odkaz:
http://arxiv.org/abs/2112.10973
Autor:
Mitsuno, Ryunosuke, Kaneko, Kenji, Nakamura, Toshifumi, Kojima, Daiki, Mizutani, Yosuke, Azegami, Tatsuhiko, Yamaguchi, Shintaro, Yamada, Yoshitake, Jinzaki, Masahiro, Kinouchi, Kenichiro, Yoshino, Jun, Hayashi, Kaori
Publikováno v:
Journal of the Endocrine Society; Jan2024, Vol. 8 Issue 1, p1-9, 9p
Autor:
Mizutani, Yosuke, Sullivan, Blair D.
We present fixed-parameter tractable (FPT) algorithms for two problems, Maximum Happy Set (MaxHS) and Densest k-Subgraph (DkS) - also known as Maximum Edge Happy Set. Given a graph G and an integer k, MaxHS asks for a set S of k vertices such that th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e988df5dfd8d562660c46d5511b60f2
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.