Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2019-03-18 15:00 |
Tokyo |
The University of Tokyo |
[Invited Talk]
Cheeger Inequalities for Submodular Transformations Yuichi Yoshida (NII) COMP2018-50 |
The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smalle... [more] |
COMP2018-50 p.45 |
IBISML |
2018-11-05 15:10 |
Hokkaido |
Hokkaido Citizens Activites Center (Kaderu 2.7) |
[Poster Presentation]
An Efficient Branch-and-Bound Algorithm for Submodular Function Maximization Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara (Osaka Univ./RIKEN) IBISML2018-68 |
The submodular function maximization is an attractive optimization model that appears in many real applications.
Altho... [more] |
IBISML2018-68 pp.183-190 |
MoNA |
2018-01-18 16:05 |
Kyoto |
Campus Plaza Kyoto |
[Encouragement Talk]
Submodular optimization based dynamic base station sleep control toward green mmWave networks Akihiro Egami, Takayuki Nishio, Masahiro Morikura (Kyoto Univ.), Yusuke Asai, Ryo Miyatake (NTT) MoNA2017-47 |
This paper proposes a dynamic millimeter-wave (mmWave) base station (BS) sleep control scheme for green mmWave networks.... [more] |
MoNA2017-47 pp.33-38 |
IBISML |
2017-11-09 13:00 |
Tokyo |
Univ. of Tokyo |
IBISML2017-72 |
We propose an accelerated best-first search (BFS) for monotone submodular function maximization with a knapsack constrai... [more] |
IBISML2017-72 pp.277-282 |
CQ |
2017-08-29 10:20 |
Tokyo |
Tokyo University of Science |
Centralized base station sleep control via submodular optimization for green mmWave networks Akihiro Egami, Takayuki Nishio, Masahiro Morikura, Koji Yamamoto (Kyoto Univ.) CQ2017-60 |
This paper proposes a dynamic millimeter-wave (mmWave) base station (BS) sleep control scheme for green mmWave networks.... [more] |
CQ2017-60 pp.53-58 |
IBISML |
2017-03-06 14:30 |
Tokyo |
Tokyo Institute of Technology |
Degrees of freedom in submodular regularization Kentaro Minami, Fumiyasu Komaki (The University of Tokyo) IBISML2016-102 |
We study two classes of convex regularization related to submodular functions, which we call the submodular regularizati... [more] |
IBISML2016-102 pp.17-24 |
IBISML |
2016-11-17 14:00 |
Kyoto |
Kyoto Univ. |
Budgeted stream-based active learning via adaptive submodular maximization Kaito Fujii, Hisashi Kashima (Kyoto Univ.) IBISML2016-74 |
Active learning enables us to reduce the annotation cost by adaptively selecting unlabeled instances to be labeled. For ... [more] |
IBISML2016-74 pp.199-206 |
COMP, IPSJ-AL |
2016-06-25 14:05 |
Ishikawa |
|
A dual descent algorithm for node-capacitated multiflow problems and its applications Hiroshi Hirai (Univ. Tokyo) COMP2016-12 |
In this paper, we develop an $O(m n^3log k)$-time algorithm to find
a half-integral node-capacitated multiflow of the... [more] |
COMP2016-12 pp.105-108 |
COMP |
2015-03-09 16:30 |
Kyoto |
Ritsumeikan University |
Tangle and ideal Koichi Yamazaki (Gunma Univ.) COMP2014-51 |
In this article, we revisit "tangle" defined on a symmetric submodular function of a set $X$ from the viewpoint of idea... [more] |
COMP2014-51 pp.61-64 |
IBISML |
2014-03-07 16:20 |
Nara |
Nara Women's University |
Binary Principal Points Based on Subgradient Method and Its Application Haruka Yamashita (Keio Univ.), Yoshinobu Kawahara (Osaka Univ.) IBISML2013-82 |
Analysis with Principal Points is a useful statistical tool for summarizing large data. Principal Points is defined as s... [more] |
IBISML2013-82 pp.109-115 |
MI |
2014-01-26 10:30 |
Okinawa |
Bunka Tenbusu Kan |
Exact solution method for MRF model-based image segmentation based on continuous optimization
-- Application to abdominal CT image and performance evaluation -- Takahiro Tayama, Hiroyuki Kudo, Hotaka Takizawa (Univ. of Tsukuba) MI2013-58 |
The medical image segmentation helps physicians to find diseased internal organs to perform the computer aided diagnosis... [more] |
MI2013-58 pp.13-18 |
IBISML |
2012-06-19 11:00 |
Kyoto |
Campus plaza Kyoto |
Online Prediction under Submodular Constraints Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto (Kyushu Univ.), Kiyohito Nagano (Tokyo Univ.) IBISML2012-3 |
[more] |
IBISML2012-3 pp.15-22 |
IBISML |
2011-11-09 15:45 |
Nara |
Nara Womens Univ. |
Prismatic algorithm for discrete D.C. programming problem Yoshinobu Kawahara, Takashi Washio (Osaka Univ.) IBISML2011-56 |
In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), {\... [more] |
IBISML2011-56 pp.93-98 |
COMP |
2009-04-17 09:45 |
Kyoto |
Kyoto Univ. |
On the Complexity of Optimal Allocation of Indivisible Goods with Second-Order Utility Functions Akiyoshi Shioura, Takuji Yoshida (Tohoku Univ.) COMP2009-1 |
In this paper, we consider an allocation problem of goods which arises from the combinatorial auction of indivisible goo... [more] |
COMP2009-1 pp.1-6 |
COMP |
2009-04-17 10:20 |
Kyoto |
Kyoto Univ. |
Algorithms for submodular systems Partition Problem Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.) COMP2009-2 |
A submodular system $(V,f)$ is a pair of a finite set $V$ and a submodular
function $f$ on $V$. The $k$-partition prob... [more] |
COMP2009-2 pp.7-14 |
COMP |
2007-04-26 13:15 |
Kyoto |
Katsura Campus, Kyoto University |
On Convex Optimization over Base Polytopes Kiyohito Nagano (Univ. of Tokyo) COMP2007-4 |
This note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition alg... [more] |
COMP2007-4 pp.25-31 |