IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 21件中 1~20件目  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2013-12-21
09:30
Okinawa Okinawa Industry Support Center 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 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 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 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 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. [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. 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. [Invited Talk] Memory-Constrained Algorithms: From Design Techniques to Applications
Tetsuo Asano (JAIST)
 [more]
COMP 2011-03-09
15:10
Tokyo Chuo Univ. 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. 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. 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. 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 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 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. 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 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 Online Uniformity of Integer Points on a Line
Tetsuo Asano (JAIST) COMP2008-15
 [more] COMP2008-15
pp.1-6
COMP 2008-06-16
14:35
Ishikawa JAIST Constant-Working-Space Image Scan with a Given Angle
Tetsuo Asano (JAIST) COMP2008-19
 [more] COMP2008-19
pp.31-36
COMP 2008-04-18
10:00
Osaka Osaka Prefecture University Constant-Working Space Algorithm for Connected Components Labeling
Tetsuo Asano, Hiroshi Tanaka (JAIST) COMP2008-1
Connected components labeling of a binary image is one of the
most fundamental operations in image processing. This pa... [more]
COMP2008-1
pp.1-8
COMP 2008-04-18
10:35
Osaka Osaka Prefecture University Constant-Working-Space Algorithm for Euclidean Distance Transform
Tetsuo Asano, Hiroshi Tanaka (JAIST) COMP2008-2
Given a binary image, Euclidean distance transform is to compute for each
pixel the Euclidean distance to the closest ... [more]
COMP2008-2
pp.9-14
 21件中 1~20件目  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan