研究者詳細 - 藤原　暁宏

論文 - 藤原　暁宏

分割表示 >> ／全件表示80 件中 1 - 80 件目

An asynchronous P system with branch and bound for the minimum Steiner tree 査読有り国際誌

Ueno Reo, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC編集委員会 ) 14 ( 2 ) 248 - 261 2024年07月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）

Membrane computing, also known as a P system, is a computational model inspired by the activity of living cells. P systems work in a polynomial number of steps, and several have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction in the number of membranes must be considered in order to make a P system a more realistic model. In the present paper, we propose an asynchronous P system using branch and bound to solve the minimum Steiner tree problem. The proposed P system solves for the minimum Steiner tree with n vertices and m edges in O(n^2) parallel steps or O(2^mn^2) sequential steps. We evaluate the number of membranes used in the proposed P system through experimental simulations. Our experimental results show the validity and efficiency of the proposed P system.

DOI： 10.15803/ijnc.14.2_248

Kyutacar

CiNii Research

An asynchronous P system for solving the minimum Steiner tree with branch and bound 査読有り

Ueno R., Fujiwara A.

Proceedings - 2023 11th International Symposium on Computing and Networking Workshops, CANDARW 2023 128 - 134 2023年11月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing, which is also known as a P system, is a computational model inspired by the activity of living cells. Several P systems, which work in a polynomial number of steps, have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction of the number of membranes must be considered in order to make a P system a more realistic model.In the present paper, we propose an asynchronous P system using branch and bound for solving the minimum Steiner tree. The proposed P system solves the minimum Steiner tree with n vertices and m edges in O(n2) parallel steps or O(2mn2) sequential steps.We evaluate the number of membranes used in the proposed P system using experimental simulations. Our experimental results show validity and efficiency of the proposed P system.

DOI： 10.1109/CANDARW60564.2023.00029

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85185722867&origin=inward

An asynchronous P system with the Bron-Kerbosch algorithm for solving the maximum clique 査読有り国際誌

Noguchi Takuya, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC編集委員会 ) 13 ( 2 ) 131 - 148 2023年07月

担当区分：最終著者,　責任著者記述言語：英語掲載種別：研究論文（学術雑誌）

Membrane computing, which is also known as a P system, is a computational model inspired by the activity of living cells. Several P systems, which work in a polynomial number of steps, have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction of the number of membranes must be considered in order to make a P system a more realistic model.

In the present paper, we propose asynchronous P systems based on the Bron-Kerbosch algorithm for solving the maximum clique problem with fewer membranes. The proposed P systems solve the maximum clique with n vertices in O(n^2) parallel steps or O(n^2 2^n) sequential steps.

We evaluate the number of membranes used in the proposed P systems by comparing with the numbers of membranes used in known P systems. Our experimental results demonstrate the validity and efficiency of the proposed P systems.

DOI： 10.15803/ijnc.13.2_131

CiNii Research

Robustness proofs for asynchronous P systems 査読有り国際誌

Tojima N., Fujiwara A.

10th International Symposium on Applied Engineering and Science (SAES2022) 2022年12月

Robust optimization algorithms for multi-objective knapsack problem 査読有り国際誌

Miyamoto T., Fujiwara A.

13th International Workshop on Advances in Networking and Computing 2022年11月

An asynchronous P system for solving the maximum clique problem with the Bron-Kerbosch algorithm 査読有り国際誌

Noguchi T., Fujiwara A.

4th International Workshop on Parallel and Distributed Algorithms and Applications 2022年11月

An asynchronous P system with a DPLL algorithm for solving SAT 査読有り国際誌

Noguchi Takuya, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC編集委員会 ) 12 ( 2 ) 238 - 252 2022年07月

担当区分：責任著者記述言語：英語掲載種別：研究論文（学術雑誌）

Membrane computing, which is also known as P system, is a computational model inspired by the activity of living cells. Several efficient P systems, which work in a polynomial number of steps, have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction of the number of membranes must be considered in order to make the P system a more realistic model.

In the present paper, we propose an asynchronous P system with a Davis-Putnam-Logemann-Loveland (DPLL) algorithm, which is a set of rules for solving a satisfiability problem (SAT) efficiently, in an attempt to reduce the number of membranes. The proposed P system solves SAT with n variables and m clauses in O(mn2) parallel steps or O(mn22n) sequential steps.

We evaluate the number of membranes used in the proposed P system by comparison with the number of membranes used in known P systems. The experimental result demonstrates the validity and efficiency of the proposed P system.

DOI： 10.15803/ijnc.12.2_238

CiNii Research

Robust asynchronous P systems for basic operations 査読有り国際誌

N. Tojima, A. Fujiwara

Symposium on Computational Science (CSCI-ISCS) 2021年12月

An asynchronous P system with branch and bound for solving the subset sum problem 査読有り国際誌

Nagao K., Fujiwara A.

Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021 241 - 247 2021年11月

担当区分：最終著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing is a computational model inspired by living cell activity. Using the membrane computing, a number of computationally hard problems have been solved by using exponential number of natural materials. However, existing algorithms for computationally hard problems define a huge number of evolution rules to execute arithmetic operations.In the present paper, we propose an asynchronous P system with branch and bound for solving the subset sum problem by applying existing P systems for elementary operations. Experimental results for the proposed P system show that the proposed method contributes to the large reduction of the numbers of evolution rules and membranes.

DOI： 10.1109/CANDARW53999.2021.00047

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85124166215&origin=inward

An asynchronous P system with a DPLL algorithm for solving a satisfiability problem 査読有り国際誌

Noguchi T., Fujiwara A.

Proceedings - 2021 9th International Symposium on Computing and Networking, CANDAR 2021 155 - 161 2021年11月

担当区分：最終著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing, which is also known as a P system, is a computational model inspired by the activity of living cells. Several efficient P systems, which work in a polynomial number of steps, have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction of the number of membranes must be considered in order to make the P system a more realistic model. In the present paper, we propose an asynchronous P system with a Davis-Putnam-Logemann-Loveland algorithm, which is a set of rules for solving a satisfiability problem (SAT) efficiently, in an attempt to reduce the number of membranes. The proposed P system solves SAT with n variables and m clauses in O({m}n^{2}) parallel steps or O(mn2^{n}) sequential steps. We evaluate the number of membranes used in the proposed P system by comparison with the number of membranes used in known P systems. The experimental result demonstrates the validity and efficiency of the proposed P system. We evaluate the number of membranes used in the proposed P system by comparison with the number of membranes used in known P systems. The experimental result demonstrates the validity and efficiency of the proposed P system.

DOI： 10.1109/CANDAR53791.2021.00029

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85124127607&origin=inward

An asynchronous P system for bitonic sort 査読有り国際誌

K. Nagao, A. Fujiwara

International Conference on Foundations of Computer Science (in conjunction with CSCE'21) 2021年07月

Population protocol for the multi-objective knapsack problem 査読有り国際誌

C. Kaneko, A. Fujiwara

International Conference on Scientific Computing (in conjunction with CSCE'21) 2021年07月

Robust asynchronous P systems for basic operations 査読有り国際誌

Tojima N., Fujiwara A.

Proceedings - 2021 International Conference on Computational Science and Computational Intelligence, CSCI 2021 592 - 597 2021年01月

担当区分：責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing, which is a computational model inspired by living cell activity, has attracted considerable attention as a new computation paradigm. Using membrane computing, several arithmetic operations have been proposed. However, when the cellular activity of an organism is used as computational hardware, the cells may be stopped or vanish for some reason. Therefore, a robust algorithm, which continues calculation even if some of the cells are stopped or vanish, is necessary for membrane computing.In the present paper, we propose robust algorithms for basic operations, which are logic functions and addition, using an asynchronous P system. The proposed P system can obtain a correct solution even if some objects vanish at any stage of computation.

DOI： 10.1109/CSCI54926.2021.00041

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85133905700&origin=inward

An asynchronous P system using branch and bound for maximum independent set

Y. Nakano, A. Fujiwara

11th International Workshop on Networking, Computing, Systems, and Software 2020年11月

An asynchronous P system for counting sort 査読有り

K. Nagao, A. Fujiwara

11th International Workshop on Advances in Networking and Computing 430 - 434 2020年11月

担当区分：責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing, which is a computational model based on cell activity, has attracted considerable attention as a new paradigm in computation. Using membrane computing, several algorithms for elementary operations, such as sorting, have been proposed. However, the proposed algorithms for sorting in membrane computing have different types of inputs. In addition, there is room for improvement on the complexities of the proposed algorithms.In the present paper, we propose an asynchronous P system based on counting sort for inputs representing binary numbers. The proposed P system sorts n binary numbers of m bits in O(mn2) sequential steps and O(mn) parallel steps.

DOI： 10.1109/CANDARW51189.2020.00088

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85102200747&origin=inward

An asynchronous P system with branch and bound for solving the knapsack problem 査読有り

Y. Nakano, A. Fujiwara

12th International Workshop on Parallel and Distributed Algorithms and Applications 230 - 236 2020年11月

担当区分：責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing, which is a computational model based on cell activity, has considerable attention as a new computation paradigm. In general membrane computing, computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, reduction of the number of membranes must be considered in order to make a P system a more realistic model.In the present paper, we propose an asynchronous P system for the 0/1 knapsack problem using branch and bound, which is a well-known optimization technique. The proposed P system solves the knapsack problem with n items and works in O(n2n) sequential steps or O(n2) parallel steps.In addition, the numbers of membranes used in the proposed P system are evaluated by computational simulation. The experimental results show the validity and efficiency of the proposed P system.

DOI： 10.1109/CANDARW51189.2020.00052

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85102204848&origin=inward

P systems with branch and bound for solving two hard graph problems 査読有り

Umetsu Kotaro, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC編集委員会 ) 10 ( 2 ) 159 - 173 2020年01月

担当区分：責任著者記述言語：英語掲載種別：研究論文（学術雑誌）

Membrane computing is a computational model based on activity of cells. Using the membrane computing, a number of computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, the number of membranes denotes the number of cells from practical point of view, and the reduction of the number of membranes must be considered for using the membrane computing in real world.In this paper, we propose asynchronous P systems with branch and bound for reducing the number of membranes for two computationally hard graph problems. We first propose an asynchronous P system that solves Hamiltonian cycle problem for a graph with n vertices, and show that the proposed P system works in O(n^2) parallel steps. We next propose an asynchronous P system that solves the minimum graph coloring for a graph with n vertices, and also show that the P system works in O(n^2) parallel steps.In addition, we evaluate validity of the proposed P systems using computational simulations. The experimental results show the validity and efficiency of the proposed P systems with branch and bound.

DOI： 10.15803/ijnc.10.2_159

CiNii Article

CiNii Research

その他リンク： https://ci.nii.ac.jp/naid/130007878671

Population-based Search Relying on Spatial and/or Temporal Scale-free Behaviors of Individuals 査読有り国際誌

Z. Zhang, Y. Zhu, A. Fujiwara, K. Ohinishi

The 2019 IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2019) 2019年12月

Strawberry optimization for multi-objective knapsack problem 査読有り

Y. Mizobe, A. Fujiwara

10th International Workshop on Advances in Networking and Computing 2019年11月

An asynchronous P system using branch and bound for minimum graph coloring 査読有り

K. Umetsu, A. Fujiwara

Workshop on Parallel and Distributed Algorithms and Applications 242 - 248 2019年11月

担当区分：責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1109/CANDARW.2019.00049

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85078849074&origin=inward

An asynchronous P system with branch and bound for solving Hamiltonian cycle problem 査読有り

Fujiwara A., Umetsu K., Nozato F.

Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019 256 - 259 2019年11月

担当区分：責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

© 2019 IEEE. In the membrane computing, the exponential num-ber of membranes is usually used for computationally hard problems to create exhaustive solutions. However, the number of membranes means the number of cells, and reduction of the number of membranes must be considered because the cells cannot be created exponentially. In the paper, we propose an asynchronous P system for Hamiltonian cycle using with branch and bound to reduce the number of membranes. In addition, we evaluate the number of membrane used in the known and the proposed P systems with experimental simulations. The experimental results show validity and efficiency of the proposed P system.

DOI： 10.1109/CANDARW.2019.00051

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85078854887&origin=inward

An asynchronous P system with branch and bound for solving the satisfiability problem 査読有り

Jimen Yuki, Fujiwara Akihiro

IJNC 8 ( 2 ) 141 - 152 2018年07月

記述言語：英語掲載種別：研究論文（学術雑誌）

Membrane computing, which is a computational model based on cell activity, has considerable attention as one of new paradigms of computations. In the general membrane computing, computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, reduction of the number of membranes must be considered to make P system more realistic model.In the paper, we propose an asynchronous P system with branch and bound, which is a well known optimization technique, to reduce the number of membranes. The proposed P system solves the satisfiability problem (SAT) with n variables and m clauses, and works in O(m2^n)$ sequential steps or O(mn) parallel steps.In addition, the number of membranes used in the proposed P system is evaluated using a computational simulation. The experimental result shows validity and efficiency of the proposed P system.

DOI： 10.15803/ijnc.8.2_141

CiNii Article

その他リンク： https://ci.nii.ac.jp/naid/130007404016

An asynchronous P system using branch and bound for the satisfiability problem 査読有り

Y. Jimen, A. Fujiwara

Workshop on Parallel and Distributed Algorithms and Applications 408 - 413 2017年12月

A firefly optimization for a connected dominating set in a sensor network 査読有り

Y. Matsumoto, A. Fujiwara

Fifth International Symposium on Computing and Networks 594 - 596 2017年12月

Solving subset sum problem using EN P system with active membrane 査読有り

T. Shiiba, A. Fujiwara

Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems 886 - 891 2016年08月

担当区分：責任著者記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Membrane computing, which is a computational model inspired by the structures and behaviors of living cells, has considerable attention as one of non-silicon based computing. As a derived model of the membrane computing, a numerical P system has been proposed from structures of living cells and economics. The numerical P system contains a number of numerical variables, which are evolved according to programs. An enzymatic numerical P system (EN P system) is also a variant of P systems such that a number of variables, which are called enzymes, are used to promote evolution programs. In the present paper, we first define membrane division on the EN P system. Then, we propose an EN P system with active membranes for solving the subset sum problem. We show that the EN P system works in O(n) parallel steps and O(n2n) sequential steps.

DOI： 10.1109/SCIS-ISIS.2016.0192

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85010440936&origin=inward

Asynchronous P systems for hard graph problems 査読有り

K. Tanaka, A. Fujiwara

International Journal of Networking and Computing 4 ( 1 ) 2 - 22 2014年01月

Asynchronous P systems for maximum independent set and related graph problems 査読有り

K. Tanaka, A. Fujiwara

15th Workshop on Advances in Parallel and Distributed Computational Models 2013年05月

Centralized algorithms for the connected target coverage in wireless sensor networks 査読有り

T. Shimokawa, A. Fujiwara

4th International Workshop on Parallel and Distributed Algorithms and Applications 2012年12月

Asynchronous SN P systems for sorting 査読有り

S. Aoki, A. Fujiwara

4th International Workshop on Parallel and Distributed Algorithms and Applications 2012年12月

Asynchronous P systems for graph coloring problems 査読有り

K. Tanaka, A. Fujiwara

4th International Workshop on Parallel and Distributed Algorithms and Applications 2012年12月

Solving SAT and Hamiltonian cycle problem using asynchronous P systems 査読有り

H. Tagawa, A. Fujiwara

IEICE TRANSACTIONS on Information and Systems E95-D ( 3 ) 746 - 754 2012年03月

The fault tolerant connected sensor cover algorithm for discrete targets

K. Kawachi, A. Fujiwara

1st International Workshop on Networking, Computing, Systems, and Software 52 - 53 2011年11月

Asynchronous P systems for arithmetic operations and factorization 査読有り

T. Murakawa, A. Fujiwara

3rd International Workshop on Parallel and Distributed Algorithms and Applications 214 - 220 2011年11月

Logic and arithmetic operations wiht a constant number of steps in membrane computing 査読有り

A. Fujiwara, T. Tateishi

International Journal of Foundations of Computer Science ２２ ( ３ ) ５４７ - 564 2011年03月

Asynchronous P systems for SAT and Hamiltonian Cycle Problem 査読有り

K. Ishii,A. Fujiwara,H. Tagawa

World Congress on Nature and Biologically Inspired Computing 520 - 526 2010年12月

Arithmetic Operations and Factorization in Membrane Computing 査読有り

A. Kambe,A. Fujiwara

The 13th Japan-Korea Joint Workshop on Algorithms and Computation 124 - 131 2010年07月

Distributed Algorithms for 2-Connected Sensor Cover in Sensor Network 査読有り

K. Nakamoto,A. Fujiwara

Proceedings of the International Conference on Wireless Networks 2010年07月

Dictionary operations in membrane computing 査読有り

H. Tagawa,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 2009年07月

Procedures for floating point operations with DNA molecules 査読有り

Y. Tokumaru,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 2009年07月

Computation wiht a constant number of steps in membrane computing 査読有り

A. Fujiwara,T. Tateishi

Proceedings of 11th Workshop on Advances in Parallel and Distributed Computational Models 2009年05月

An access point selection algorithm for heterogeneous stations 査読有り

Y. Sagara,A. Fujiwara

The 2008 International Conference on Wireless Networks 2008年07月

Procedures for computing the maximum with DNA 査読有り

A. Fujiwara,S. Kamio,A. Takehara

International Journal of Foundations of Computer Science 18 ( 3 ) 475 - 493 2007年04月

Data structures for storing binary numbers in DNA computing 査読有り

T. Tateishi,A. Fujiwara

International Conference on Foundations of Computer Science 2007年04月

Access point selection algorithms for maximizing throughputs in wireless LAN environment 査読有り

A. Fujiwara,Y. Sagara,M. Nakamura

International Conference on Parallel and Distributed Systems 2007年04月

Procedures multiplication and division in DNA computing 査読有り

H. Fukagawa,A. Fujiwara

The International Conference on Foundations of Computer Science 2006年06月

A procedure for MAX-SAT with DNA strands 査読有り

Y. Tokumaru,A. Fujiwara

The International Conference on Foundations of Computer Science 2006年06月

A cost optimal parallel algorithm for patience sorting 査読有り

T. Nakashima,A. Fujiwara

Parallel Processing Letters 16 ( 1 ) 39 - 51 2006年01月

A scheduling algorithm with static partition for total exchange 査読有り

K. Nakahira,A. Fujiwara

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications 739 - 745 2005年04月

Analysis of access point selection strategy in wireless LAN 査読有り

Y. Fukuda,A. Fujiwara,M. Tsuru,Y. Oie

roceedings of IEEE 62nd Semiannual Vehicular Technology Conference (VTC2005-fall) 25 - 28 2005年04月

A Procedure for Computing 0-1 Integer Programming with DNA Strands 査読有り

K. Atsuyama,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 125 - 134 2005年04月

Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands 査読有り

M. Ushijima,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 52 - 58 2005年04月

Procedures for multiple input function with DNA molecules 査読有り

A. Fujiwara,S. Kamio

International Journal of Foundations of Computer Science 16 ( 1 ) 37 - 54 2005年01月

Procedures for Multiple Input Functions with DNA Strands 査読有り

A. Fujiwara,S. Kamio

Proceedings of Workshop on Advances in Parallel and Distributed Computational Models (in conjunction with IPDPS2004) 2004年04月

Procedures for logic and arithmetic operations with DNA molecules 査読有り

A. Fujiwara,K. Matsumoto,W. Chen

International Journal of Foundations of Computer Science 15 ( 3 ) 461 - 474 2004年03月

Procedures for computing the maximum with DNA strands 査読有り

S. Kamio,A. Takehara,A. Fujiwara

Proceedings of the International Conference on Parallel and Distributed Processing Symposium 351 - 357 2003年04月

Addressable procedures for logic and arithmetic operations with DNA strands 査読有り

A. Fujiwara,K. Matsumoto,W. Chen

Proceedings of Workshop on Advances in Parallel and Distributed Computational Models 2003年04月

Efficient scheduling algorithms for total exchange on GRID environment 査読有り

Y. Jinno,M. Ito,A. Fujiwara

Proceedings of the International Conference on Parallel and Distributed Processing Symposium 81 - 87 2003年04月

A Parallel Algorithm For The Stack Breadth-First Search 査読有り

T. Nakashima,A. Fujiwara

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E85-D ( 12 ) 1955 - 1958 2002年12月

Parallel algorithms for patience sorting and longest increasing subsequence 査読有り

T. Nakashima,A. Fujiwara

Proceedings of the International Conference in Networks, Parallel and Distributed Processing and Applications 7 - 12 2002年10月

Parallelizability of some P-complete problems 査読有り

A. Fujiwara,M. Inoue,M. Toshimitsu

Workshop on Advances in Parallel Computational Models (Lecture Notes in Computer Science, 1800) 116 - 122 2002年01月

Parallelizability of some geometric P-complete problems in the EREW-PRAM 査読有り

C.D. Castanho,W. Chen,K. Wada,A. Fujiwara

Seventh Annual International Computing and Combinatorics Conference (COCOON2001) 59 - 63 2001年08月

Parallelizability of the stack breadth-first search problem 査読有り

T. Nakashima,A. Fujiwara

International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'01) 722 - 727 2001年06月

Round optimal parallel algorithms for the convex hull of sorted points 査読有り

N. Oshige,A. Fujiwara

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E84-A ( 5 ) 1152 - 1160 2001年05月

Polynomially fast parallel algorithms for some P-complete problems 査読有り

C.D. Castanho,W. Chen,K. Wada,A. Fujiwara

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E84-A ( 5 ) 1244 - 1255 2001年05月

辞書式順極大３和問題に対するBSPモデル上のコスト最適な並列アルゴリズム査読有り

中島孝明,藤原暁宏

情報処理学会論文誌「並列処理」特集号 42 ( 4 ) 724 - 731 2001年04月

Polynomially fast parallel algorithms for some geometric P-complete problems 査読有り

C.D. Castanho,W. Chen,K. Wada,A. Fujiwara

Workshop on Computational Geometry 10 - 15 2000年10月

Parallel selection algorithms for CGM and BSP models with application to sorting 査読有り

A. Fujiwara,M. Inoue,T. Masuzawa

IEICE Trans. Information and Systems E83-D ( 5 ) 1500 - 1508 2000年04月

２分木の平衡分解木を求めるコスト最適な並列アルゴリズム査読有り

藤原暁宏,井上美智子,増澤利光,都倉信樹

電子情報通信学会論文誌D-I J83-D-I ( 1 ) 90 - 98 2000年04月

Parallel algorithms for the all nearest neighbor problems of binary image on the BSP model 査読有り

T. Ishimizu,A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

IEICE Transactions on Information and Systems E83-D ( 2 ) 151 - 158 2000年04月

Parallel selection algorithms with analysis on clusters 査読有り

A. Fujiwara,H. Katsuki,M. Inoue,T. Masuzawa

Proc. Internatinal Symposium on Parallel Architechtures, Algorithms and Networks (ISPAN'99) 388 - 393 1999年06月

Parallel algorithms for all nearest neighbors of binary images on the BSP model 査読有り

T. Ishimizu,A. Fujiwara,M. Inoue,T. Masuzawa

Proc. Internatinal Symposium on Parallel Architechtures, Algorithms and Networks (ISPAN'99) 394 - 399 1999年06月

A cost optimal parallel algorithm for weighted distance transforms 査読有り

A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

Parallel computing 25 ( 4 ) 405 - 416 1999年04月

選択問題を解くBSPモデルおよびBSP*モデル上の並列アルゴリズム査読有り

石水隆,藤原暁宏,井上美智子,増澤利光,藤原秀雄

電子情報通信学会論文誌(DI) J82-D-I ( 4 ) 533 - 542 1999年04月

A parallel algorithm for Euclidean distance transform on the mesh 査読有り

A. Fujiwara,M. Inoue,T. Masuzawa

Proc. international conference on parallel and distributed processing techiques and applications(PDPTA'98) 1726 - 1733 1998年04月

A parallel algorithm for weighted distance transforms 査読有り

A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

Proceedings of 11th International Parallel Processing Symposium 407 - 412 1997年04月

A simple parallel algorithm for the medial axis transform 査読有り

藤原暁宏,井上美智子,増澤利光,藤原秀雄

IEICE Transaction on Information and Systems E79-D ( 8 ) 1038 - 1045 1996年04月

濃淡画像の連結成分を求める並列アルゴリズム査読有り

藤原暁宏,増澤利光,藤原秀雄

電子情報通信学会論文誌(DI) J79-D1 ( 5 ) 215 - 225 1996年04月

A simple parallel algorithm for the medial axis transform of binary images 査読有り

A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

Proceedings of IEEE Second International Conference on Algorithms&Architectures for Paralle Processing 1 - 8 1996年04月

An optimal parallel algorithm for the Euclidean distance map of 2-D binary images 査読有り

藤原　暁宏

Information Processing Letters 54 ( 5 ) 295 - 300 1995年04月

An optimal parallel algorithm for the Euclidean distance maps of binary images 査読有り

A. Fujiwara,T. Masuzawa,H. Fujiwara

Proceedings of First IEEE Internatinal Conference on Algorithms and Architecture for Parallel Processing 928 - 928 1995年04月

　前のページ-次のページ　

<藤原 暁宏>

論文 - 藤原 暁宏

<藤原　暁宏>

論文 - 藤原　暁宏