Time-Space trade-off algorithms for sensor networks
Publicly Offered Research
| Project Area | A multifaceted approach toward understanding the limitations of computation |
|---|
| Project/Area Number |
15H00855
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
|
| Allocation Type | Single-year Grants |
|---|
| Review Section |
Science and Engineering
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
Korman Matias 東北大学, 情報科学研究科, 助教 (80732718)
|
|---|
| Project Period (FY) |
2015-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2016: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2015: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | Algorithms / Time-Space Trade-off / Computational Geometry / Computer Science / Memory Constrains / Simple Polygons / Sensor Networks / Memory Constrained |
|---|
| Outline of Annual Research Achievements |
The project has been very fruitful, both from a theoretical and a practical point of view. All planned milestones have been achieved.
On one hand, we have found several interesting theoretical trade-offs. Some of which are specific techniques for fundamental problems, but others are general methods that can be used for more than one problem. Overall, with the help of this project we have accomplished over 25 publications in peer reviewed conferences and international journals (several of which appeared in top theory conferences). In addition, we have initiated or strengthened ties with more than 20 other research centers, most of them outside Japan.
From a practical point of view, we have also implemented the compressed stack technique as we planned. The code has been done with the help of other researchers within Tohoku University. Code has been released as open source (it is currently available at https://github.com/Azzaare/CompressedStacks.jl). We have run experiments to verify the performance of the data structure. As expected, the data structure uses very little memory. In addition, we have observed that the running time is quite good. Details of these experiments will be submitted for publication in the following months.
|
| Research Progress Status |
28年度が最終年度であるため、記入しない。
|
| Strategy for Future Research Activity |
28年度が最終年度であるため、記入しない。
|
Report
(2 results)
Research Products
(27 results)
-
-
-
-
-
[Journal Article] Minimum dual diameter triangulations.2016
Author(s)
M. Korman, S. Langerman, W. Mulzer, A. Pilz, and B. Vogtenhuber.
-
Journal Title
Computational Geometry: Theory and Applications (in press)
Volume: 1
Related Report
Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
-
-
-
-
-
[Journal Article] Cannibal Animal Games: a new variant of Tic-Tac-Toe2015
Author(s)
J. Cardinal, S. Collette, H. Ito, H. Sakaidani, M. Korman, S. Langerman, and P. Taslakian.
-
Journal Title
Journal of Information Processing
Volume: 23
Issue: 3
Pages: 265-271
DOI
NAID
ISSN
1882-6652
Related Report
Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
-
-
-
-
[Presentation] Symmetric assembly puzzles are hard, beyond a few pieces2016
Author(s)
E. D. Demaine, M. Korman, J. S. Ku, J. S. B. Mitchell, Y. Otachi, A. van Renssen, M. Roeloffzen, R. Uehara, and Y. Uno
Organizer
18th Discrete and Computational Geometry and Graphs (JCDCGG 2015)
Place of Presentation
Kyoto University (Kyoto)
Year and Date
2016-09-14
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-
