Kyoto Architecture University

output

20082024

most citedMetric Dimension of Bounded Tree-length Graphs

2 citations

6 papers

stat.AP2024★ 2 cited

Latent Space-Based Likelihood Estimation Using a Single Observation for Bayesian Updating of a Nonlinear Hysteretic Model

Sangwon Lee, Taro Yaoyama, Yuma Matsumoto +2

This study presents a novel approach to quantifying uncertainties in Bayesian model updating, which is effective in sparse or single observations. Conventional uncertainty quantifi…

cs.OS2019

Faster than Flash: An In-Depth Study of System Challenges for Emerging Ultra-Low Latency SSDs

Sungjoon Koh, Junhyeok Jang, Changrim Lee +3

Emerging storage systems with new flash exhibit ultra-low latency (ULL) that can address performance disparities between DRAM and conventional solid state drives (SSDs) in the memo…

cs.DS2016★ 2 cited

Metric Dimension of Bounded Tree-length Graphs

Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach +1

The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely identifying every vertex in a graph. A set of vertices in…

math.CO2015

The Price of Connectivity for Feedback Vertex Set

Rémy Belmonte, Pim van 't Hof, Marcin Kamiński +1

Let fvs $(G)$ and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph $G$ , respectively. The price of connectivi…

math.CO2014★ 1 cited

Extended Formulations for Sparsity Matroids

Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh +2

We show the existence of a polynomial-size extended formulation for the base polytope of a $(k, ℓ)$ -sparsity matroid. For an undirected graph $G = (V, E)$ , the size of the formulati…

cs.DM2008

Covering Directed Graphs by In-trees

Naoyuki Kamiyama, Naoki Katoh

Given a directed graph $D = (V, A)$ with a set of $d$ specified vertices $S = {s_{1}, ..., s_{d}} \subseteq V$ and a function $f : S \to Z_{+}$ where $Z_{+}$ denotes the se…