2017年 | |
1/5 - 8
| CCS 2017 |
| Place : Victoria University of Wellington, New Zealand |
| in honour of Rod Downey's 60th birthday
|
1/9 - 11
| ITCS 2017 |
| 投稿〆切 : 2016/9/15 |
| Place : Berkeley, CA, USA |
1/10 - 5/12
| Foundations of Machine Learning |
| Place : Simons Institute, Berkeley |
1/10 - 5/12
| Pseudorandomness |
| Place : Simons Institute, Berkeley |
| url : https://simons.berkeley.edu/programs/pseudorandomness2017 |
1/13
| [elc] ELCセミナー(Prof. Mitsunori Ogihara) |
| Place : CELC Seminar room |
| title: The Complexity of the Predecessor and Garden-of-Eden Problems
of Synchronous Boolean Finite Dynamical Systems
date: January 13rd, 2017, 11:00-
place: CELC Seminar room
presenter: Mitsunori Ogihara, University of Miami
Click to Continue ...Absrtact: The boolean finite dynamical system is the most stringent form
of dynamical systems in which the system size is fixed, the state of each
object in the system is boolean, and the state update occurs synchornously
for all the objects in the system. The action in one step of a system
can be viewed as a function from a set of some n boolean variables to
itself, and thus, the reversing action as a partial one-to-many function
of that set.
This talk considers the complexity of two problems related to the
reversibility:
(1) The t-Predecessor Problem: given a configuration and t >= 1,
is it possible to reverse the process from the configuration
successfully t times?
(2) The t-Garden-of-Eden Problem: given a configuration and t >= 1,
is it possible to reverse the process from the configuration
successfully t times to arrive at a configure with no inverse?
In this talk, I will present some results to pinpoint the complexity of
these problems for various sets of function basis.
(a) If the available function is pure bit transferring (i.e., assign the
value of one state to another), both problems are in AC^0.
(b) If the available function is the bounded-fan-in OR (or the
bounded-fan-in AND), both problems are in AC^0.
(c) If the available function is the unbounded-fan-in OR (or the
unbounded-fan-in AND), the t-Predecessor Problem is in AC^0 and
the t-Garden-of-Eden Problem is NP-complete for all constants t.
(d) If the functions are chosen from the 2-fan-in OR and the 2-fan-in
AND, the 1-Predecessor Problem is NL-complete and the
1-Garden-of-Eden Problem is NL-hard and is in NP.
(e) If the functions are chosen from the 3-fan-in OR and the 2-fan-in
AND (or from the 2-fan-in OR and the 3-fan-in AND), then the
t-Predecessor Problem is NP-complete and the t-Garden-Of-Eden
Problem is Sigma^p_2-complete.
This is joint wirk with Akinori Kawachi (Kochi U.) and Kei Uchizawa
(Yamagata U.)
|
1/16 - 19
| SODA 2017 |
| 投稿〆切 : 2016/7/13 |
| Place : Universitat Politecnica de Catalunya, Barcelona, Spain |
| url : https://www.siam.org/meetings/da17/ |
| SUBMISSION DEADLINES
July 6, 2016, 4:59 PM EDT - Deadline - Short Abstract Submission and Paper Registration Deadline
July 13, 2016, 4:59 PM EDT - Deadline - Full Paper Submission
January 16:
Analytic Algorithmics and Combinatorics (ANALCO17)
Click to Continue ...January 17:
Algorithm Engineering and Experiments (ALENEX17)
|
1/17
| アルゴリズム研究会 |
| Place : アイーナいわて県民情報交流センター (盛岡市) |
1/26 - 27
| DIMACS Workshop on E+M=C^2 (Eric Allender and Mike Saks are 60) |
| Place : DIMACS, New Jersey |
2/1 - 3
| 冬のLAシンポジウム |
| Place : 京都大学数理解析研究所 |
2/4 - 9
| AAAI-17 |
| 投稿〆切 : 2016/9/4 |
| Place : San Francisco, California USA |
3/6
| 組合せゲーム・パズル研究集会 |
| Place : 名古屋大学 |
3/6
| [elc] ELC Seminar (Prof. Pekka Orponen) |
| Place : CELC Seminar Room |
| ELC C01 Seminar
Date: March 6th, 4:00 - 5:00
Place: ELC Seminar room (Tokyo Tech CIC, Tamachi, 4F)
Title: Algorithmic design of complex 3D DNA origami structures
Speaker: Pekka Orponen
Click to Continue ... Aalto University, Computer Science
Abstract:
In a recent work (Nature 523:441-444, July 2015), we described a general
methodology and software pipeline for rendering 3D polyhedral mesh
designs in DNA. In this talk, I will first summarise the basic idea of
Paul Rothemund's DNA origami technique which also underlies our
approach, and then proceed to discuss the graph-theoretic concepts and
algorithmic ideas used in extending his technique from 2D patterns to 3D
wireframe mesh structures. The reliability and generality of the
approach is demonstrated by a number of electron microscopy images of
synthesised nanostructures, including a 50-nm rendering of the
widely-used Stanford Bunny model.
Host: Osamu Watanabe (watanabe@is.titech.ac.jp)
|
3/7
| コンピュテーション研究会 |
| Place : 南山大学 (名古屋市) |
3/8 - 11
| STACS 2017 |
| 投稿〆切 : 2016/9/25 |
| Place : Hannover, Germany |
| url : https://stacs2017.thi.uni-hannover.de/ |
3/10
| [elc] 2016年度第2回領域会議 |
| Place : 東京工業大学キャンパス・イノベーションセンター (田町) |
| 場所: 東京工業大学キャンパス・イノベーションセンター
(田町駅から徒歩1分 http://www.cictokyo.jp/access.html)
2階多目的ルーム 2
領域会議
13:00-13:05 はじめに
13:05-13:30 公募班(Skip Jordan)の成果報告
Click to Continue ...13:30-13:55 公募班(安永 憲司)の成果報告
13:55-14:20 公募班(泉 泰介)の成果報告
14:20-14:45 公募班(Korman Matias)の成果報告
14:45-15:00 休憩
15:00-15:25 公募班(塩浦 昭義)の成果報告
15:25-15:50 公募班(伊藤 健洋)の成果報告
15:50-16:15 公募班(森前 智行)の成果報告
16:15-16:30 休憩
16:30ー18:00 拡大総括班会議(総括班メンバー,班幹事,公募班メンバー)
|
3/11
| [elc] 公開シンポジウム |
| Place : 東京工業大学キャンパス・イノベーションセンター (田町) |
| 場所: 東京工業大学キャンパス・イノベーションセンター
(http://www.cictokyo.jp/access.html)
1階国際会議室
公開シンポジウム(+評価会議)
場所: 東工大田町キャンパスイノベーションセンター
(同上)
Click to Continue ...日時: 3月11日10:00~17:00
10:00-10:10 本領域について 渡辺治 代表
10:10-10:25 A01班
10:25-10:40 A02班
10:40-10:55 A03班
10:55-11:10 <休憩>
11:10-11:25 B01班
11:25-11:40 B02班
11:40-11:55 B03班
11:55-13:30 <お昼休み>
13:30-13:45 C01班
13:45-14:00 C02班
14:00-14:15 C03班
14:15-14:30 <休憩>
14:30-14:40 本領域での新たな取り組み
14:40-14:55 GCTの成果報告
14:55-15:10 スパコンの利用に関する成果報告
15:10-15:20 <休憩>
15:20-15:30 連携研究推進・若手育成の試み
15:30-15:55 若手成果発表1
15:55-16:20 若手成果発表2
16:20-16:45 若手成果発表3
16:45-16:50 閉会の辞
※発表会終了後,評価会議(非公開)を行います
|
3/13 - 14
| アルゴリズム研究会 |
| Place : 大分県由布市 |
3/16 - 18
| 情報処理学会 第79回全国大会 |
| Place : 名古屋大学 (名古屋市) |
3/22 - 25
| 電子情報通信学会 2017年総合大会 |
| Place : 名城大学 (名古屋市) |
3/29 - 31
| WALCOM 2017 (The 11th International Conference and Workshop on Algorithms and Computation) |
| 投稿〆切 : 2016/9/17 |
| Place : 新竹 (Hsinchu), 台湾 (Taiwan) |
4/20 - 21
| MATCH-UP 2017 (The Fourth International Workshop on Matching Under Preferences) |
| 投稿〆切 : 2016/12/9 |
| Place : Microsoft Research New England in Cambridge, MA, USA |
| url : https://www.microsoft.com/en-us/research/event/match-up-2017/ |
4/30 - 5/4
| Eurocrypt 2017 |
| Place : Paris, France |
| url : https://eurocrypt2017.di.ens.fr/ |
5/5 - 7
| AAAC 2017 |
| 投稿〆切 : 2017/2/10 |
| Place : Hong Kong University of Science and Technology, Hong Kong |
5/12 - 13
| アルゴリズム研究会 |
| Place : 長崎県長崎市 |
5/12 - 13
| コンピューテーション研究会 |
| Place : 長崎県建設工業協同組合(長崎市) |
| アルゴリズム研究会と共催。COMP研専門委員会(5/12)あり。
|
5/22 - 25
| 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications |
| Place : Budapest, Hungary |
6/6 - 8
| CTW 2017 (15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization) |
| Place : the University of Cologne, ドイツ |
6/6 - 12
| ICML 2017 |
| 投稿〆切 : 2017/1/9 |
| Place : Sydney, Australia |
| url : https://2017.icml.cc/ |
6/8 - 12
| CSR 2017 |
| 投稿〆切 : 2016/12/15 |
| Place : Kazan, Russia |
6/9 - 11
| Highlights of Algorithms 2017 |
| Place : Berlin |
6/19 - 23
| STOC 2017 |
| 投稿〆切 : 2016/11/2 |
| Place : Montreal |
6/20 - 23
| LICS 2017 |
| 投稿〆切 : 2017/1/9 |
| Place : Reykjavik |
6/23 - 27
| SPAA 2017 |
| Place : Washington DC, USA, |
6/26 - 28
| IPCO 2017 |
| 投稿〆切 : 2016/11/20 |
| Place : University of Waterloo |
7/6 - 9
| CCC 2017 |
| 投稿〆切 : 2017/2/15 |
| Place : Riga, Latvia |
7/7 - 10
| COLT 2017 |
| Place : Amsterdam, The Netherlands |
7/10 - 14
| ICALP 2017 |
| 投稿〆切 : 2017/2/17 |
| Place : Warsaw, Poland |
7/18 - 20
| 夏のLAシンポジウム |
| Place : 天童温泉 |
7/31 - 8/2
| WADS 2017 |
| 投稿〆切 : 2017/2/20 |
| Place : Memorial University of Newfoundland, St. John’s, Canada |
8/3 - 5
| COCOON 2017 |
| 投稿〆切 : 2016/3/20 |
| Place : Hong Kong |
8/6 - 8
| MOVES 2017 (Mathematics Of Various Entertaining Subjects) "The Magic of Math" |
| Place : MOMATH (The National Museum of Mathematics), NY, USA |
8/16 - 18
| RANDOM-APPROX 2017 |
| 投稿〆切 : 2017/4/14 |
| Place : University of California, Berkeley, USA |
8/16 - 12/15
| Bridging Continuous and Discrete Optimization |
| Place : Simons Institute, Berkeley |
| url : https://simons.berkeley.edu/programs/optimization2017 |
8/19 - 25
| IJCAI-17 |
| Place : Melbourne, Australia |
8/20 - 24
| Crypto 2017 |
| Place : Santa Barbara, USA |
| url : https://www.iacr.org/events/ |
8/20 - 24
| CSL 2017 |
| Place : Stockholm |
| url : https://www.csl17.conf.kth.se/ |
8/21 - 25
| MFCS 2017 |
| Place : Aalborg, Denmark |
8/28 - 9/1
| Eurocomb 2017 (European Conference on Combinatorics, Graph Theory and Applications) |
| 投稿〆切 : 2017/3/15 |
| Place : ウィーン, オーストリア |
| ALGO 2017 (9/04-08) と連続開催
|
8/28 - 9/1
| SAT 2017 |
| 投稿〆切 : 2017/5/2 |
| Place : Melbourne, Australia |
8/29 - 9/1
| JCDCG^3 2017 (20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games) |
| Place : Tokyo Univ. of Science, Kagurazaka, Shinjuku-ku, Tokyo, Japan |
9/4 - 8
| ALGO 2017 |
| Place : ウィーン, オーストリア |
| url : https://algo2017.ac.tuwien.ac.at/ |
| ESA 2017 はこの中で開催されます。
Eurocomb 2017 と連続開催。
|
10/-
| ALT 2017 |
10/14 - 17
| FOCS 2017 |
| Place : San Francisco, CA, USA |
12/4 - 9
| NIPS 2017 |
| Place : Long Beach Convention Center, Long Beach, CA, USA |
| url : https://nips.cc/Conferences/2017 |
12/10 - 12
| ISAAC 2017 |
| Place : Phuket, Thailand |