| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2022-05-19 13:00 |
Online | Online (Online) | Transportation Problem on a Graph Tetsuo Asano (Kanazawa Univ.)  COMP2022-1 |
We consider a transportation problem defined on a node-weighted undirected graph. Weight is positive if the amount of c... [more] | COMP2022-1 pp.1-8 |
| COMP, IPSJ-AL | 2022-05-19 13:35 |
Online | Online (Online) | Transportation Problem Allowing Sending and Bringing Back Tetsuo Asano (Kanazawa Univ.) COMP2022-2 |
This paper considers a transportation problem on a weighted graph. The weights specify the amounts of commodities at no... [more] | COMP2022-2 pp.9-16 |
| COMP, IPSJ-AL | 2021-08-25 15:30 |
Online | Online (Online) | [Invited Talk]
Transportation Problem on a Graph Allowing Sending and Bringing-back Tetsuo Asano (Kanazawa Univ.) COMP2021-10 |
There are a number of problems classified as a transportation problem. In this paper we consider one of allowing sendin... [more] | COMP2021-10 p.9 |
| COMP | 2013-12-21 09:30 |
Okinawa | Okinawa Industry Support Center (Okinawa) | An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon Matsuo Konagaya, Tetsuo Asano (JAIST), Otfried Cheong (KAIST), Sang Won Bae (Kyonggi Univ.) COMP2013-48 |
Given a simple polygon with $n$ vertices in a plane, we compute the shortest path between two query points using less ... [more] |
COMP2013-48 pp.59-62 |
| COMP | 2013-12-21 09:55 |
Okinawa | Okinawa Industry Support Center (Okinawa) | An Algorithm for Finding the Point Minimizing the Distance Error to Given Points Shigeki Nakamura, Tetsuo Asano (JAIST), Siu-Wing Cheng (HKUST) COMP2013-49 |
Given $n$ points in the plane, we want to insert a new point in the distance specified by the input from each existing p... [more] | COMP2013-49 pp.63-68 |
| COMP | 2013-12-21 10:20 |
Okinawa | Okinawa Industry Support Center (Okinawa) | Adjustable Work Space Algorithm of Arrangement of Lines Takahiro Seii, Tetsuo Asano (JAIST) COMP2013-50 |
This paper presents an adjustable work space algorithm for an arrangement of lines. An arrangement of lines is the part... [more] |
COMP2013-50 pp.69-72 |
| COMP, IPSJ-AL | 2013-05-18 14:25 |
Hokkaido | Otaru University of Commerce (Hokkaido) | A New Framework for Connected Components Labeling of Binary Images Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas) COMP2013-16 |
Given a binary image of $n$ pixels, assign integral labels to all pixels so that any background pixel has label $0$ ... [more] |
COMP2013-16 pp.127-134 |
| COMP | 2012-04-27 15:20 |
Osaka | Osaka Prefecture University (Osaka) | Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size Matsuo Konagaya, Tetsuo Asano (JAIST) COMP2012-7 |
This paper presents an efficient algorithm for reporting all intersections among $n$ given line segments in the plane u... [more] |
COMP2012-7 pp.45-52 |
| COMP | 2011-12-16 17:15 |
Aichi | Nagoya Univ. (Aichi) | [Invited Talk]
Research Story on Distance Trisector Curves: How was it born and developed? Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo) COMP2011-46 |
It is easy to draw a bisecting line for two points in the plane. Is it also easy to draw two curves between two points t... [more] | COMP2011-46 p.71 |
| COMP | 2011-10-21 10:00 |
Miyagi | Tohoku Univ. (Miyagi) | Memory-Constrained Algorithms for Shortest Path Problem Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP2011-28 |
This paper presents a space-efficient algorithm for finding a shortest path in a grid graph whose size is $\sqrt{n}\tim... [more] |
COMP2011-28 pp.1-5 |
| COMP | 2011-05-11 16:00 |
Nagano | Shinshu Univ. (Nagano) | [Invited Talk]
Memory-Constrained Algorithms: From Design Techniques to Applications Tetsuo Asano (JAIST) |
[more] | |
| COMP | 2011-03-09 15:10 |
Tokyo | Chuo Univ. (Tokyo) | Recognition of Basic Planar Objects Using Computational Geometry Methods Yoshihiro Hirashiki, Tetsuo Asano (JAIST) COMP2010-52 |
Making computers recognize a planar object exactly is useful in developing of factory products. Positioning problem in f... [more] | COMP2010-52 pp.37-44 |
| COMP | 2010-10-15 09:30 |
Miyagi | Tohoku Univ. (Miyagi) | Constant-Work-Space Algorithms for Geometric Problems(1) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-31 |
We present space-efficient algorithms for geometric problems in a restricted computational model called ``constant wo... [more] |
COMP2010-31 pp.1-7 |
| COMP | 2010-10-15 10:05 |
Miyagi | Tohoku Univ. (Miyagi) | Constant-Work-Space Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-32 |
We present space-efficient algorithms for geometric problems in a restricted computational model called ``constant wor... [more] | COMP2010-32 pp.9-15 |
| COMP | 2010-09-29 11:10 |
Niigata | Nagaoka Univ. of Tech. (Niigata) | In-place algorithm for Erasing a Component in a Binary Image Tetsuo Asano (JAIST) COMP2010-26 |
Removing noises in a given binary image is one of common operations. A generalization of the operation is to erase an... [more] |
COMP2010-26 pp.17-23 |
| COMP | 2010-06-25 16:00 |
Tokyo | Tokyo Tech (Tokyo) | A Constant Work Space Algorithm for Finding Nearest Larger Neighbors Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas), David Kirkpatrick (Univ. of British Columbia) COMP2010-22 |
In this report we consider a problem of finding nearest larger elements using only constant work space in addition to ... [more] |
COMP2010-22 pp.45-52 |
| COMP, IPSJ-AL | 2010-05-19 15:05 |
Ishikawa | Japan Advanced Institute of Science and Technology (Ishikawa) | Binary Image Processing with Limited Storage Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas, USA), Lilian Buzer (Univ. Paris-Est/LABINFO-IGM), David Kirkpatrick (Univ. of British Columbia) COMP2010-12 |
Removing noises in a given binary image is one of common operations. A generalization of the operation is to erase an... [more] |
COMP2010-12 pp.31-38 |
| PRMU, IE, MI | 2010-05-14 10:15 |
Aichi | Chubu Univ. (Aichi) | Detecting retinal layers and optic nerve head structure using optical coherence tomography images
-- Automatic measurement of RNFL thickness and C/D ratio -- Makoto Shohara, Tetsuo Asano (JAIST) IE2010-33 PRMU2010-21 MI2010-21 |
The optical coherence tomography (OCT) is widely used for the diagnosis of the glaucoma recently. It is important to mea... [more] | IE2010-33 PRMU2010-21 MI2010-21 pp.109-113 |
| COMP | 2010-03-12 11:00 |
Tokyo | National Institute of Informatics (Tokyo) | Deterministic Constant-Work-Space Algorithms for two dimensional Linear Programming Tetsuo Asano (JAIST), Danny Chen (Univ. of Notre Dame), Takeshi Tokuyama (Tohoku Univ.) COMP2009-52 |
[more] | COMP2009-52 pp.19-24 |
| COMP | 2008-06-16 09:45 |
Ishikawa | JAIST (Ishikawa) | Online Uniformity of Integer Points on a Line Tetsuo Asano (JAIST) COMP2008-15 |
[more] | COMP2008-15 pp.1-6 |
[Return to Top Page]