Loading [MathJax]/extensions/MathMenu.js

Hongwei Fan - IEEE Xplore Author Profile

Scheduled Maintenance on Monday 1/13/2025

Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.

IEEE.org
IEEE Xplore
IEEE SA
IEEE Spectrum
More Sites

- Donate
- Personal Sign In

Access provided by:

MIT Libraries

Access provided by:

MIT Libraries

ADVANCED SEARCH

Author details

Hongwei Fan

Publications

2

Citations

6

Publications by Year

20232024

Co-Authors:

Jun ChaiBing GuoChendong MaJun SongTuo Sun

Show All Co-Authors (9)

Hongwei Fan

Affiliation

Department of Natural Sciences

Imperial College London

London, U.K

Publication Topics

Analytic Hierarchy Process,
Autoregressive Integrated Moving Average,
Bike-sharing,
Convolutional Neural Network,
Detection Speed,
Dynamic Time Warping,
Edge Computing,
Edge Devices,
Field Exploration,
Intelligent Transportation Systems,
Kalman Filter,
Land Use

Biography

Hongwei Fan received the M.S. degree from Tsinghua University, China. He is currently pursuing the Ph.D. degree with the Department of Centre for Environmental Policy, Imperial College London. He was a Senior Computer Vision Algorithm Researcher with SenseTime. His research interests include computer vision, data mining, and urban computing.(Based on document published on 2 June 2023).

Publications

2

Citations

6

Publications by Year

20232024

Co-Authors:

Jun Chai
Bing Guo
Chendong Ma
Jun Song
Tuo Sun

Show All Co-Authors (9)

Author's Published Works

Search History

Showing 1-25 of 32,938 resultsfor "Index Terms":Space Complexity

Conferences (22,147)

Journals (10,386)

Magazines (299)

Early Access Articles (97)

Books (8)

Standards (1)

Sort

Filter Results

Show

Subscribed Content

Open Access Only

Range
Single Year
Lajos Hanzo(86)
Wei Wang(77)
Wei Zhang(64)
Jun Li(62)
Lei Wang(54)
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore(84)
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China(84)
Department of Electronic Engineering, Tsinghua University, Beijing, China(83)
School of Computer Engineering, Nanyang Technological University, Singapore(76)
University of Chinese Academy of Sciences, Beijing, China(67)
IEEE Access(1,084)
IEEE Transactions on Knowledge and Data Engineering(450)
IEEE Transactions on Signal Processing(429)
IEEE Transactions on Information Theory(379)
IEEE Transactions on Vehicular Technology(360)
IEEE(32,280)
OUP(145)
IET(132)
MIT Press(96)
BIAI(61)
Media(728)
Code(37)
Datasets(17)
Video(4)
Beijing, China(505)
Shanghai, China(391)
Chengdu, China(293)
Singapore(265)
Vancouver, BC, Canada(261)
Time Complexity(9,027)
Space Complexity(7,443)
Computational Complexity(6,210)
Time And Space(3,263)
State Space(2,205)
Superseded(1)
Standard Docs(1)

Select All on Page

Sort By

Results

Space and time complexity for infinite time Turing machines

Journal of Logic and Computation

Year: 2020 | Volume: 30, Issue: 1 | Journal Article |

Cited by: Papers (1)

We consider notions of space by Winter [21, 22]. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P$_{+}=$PSPACE$_{+}$ and P$_{++}=$PSPACE$_{++}$ holds for ITTMs (all three are false). We also show various separation results between space complexity classes for ITTMs. ...Show More

Space and time complexity for infinite time Turing machines

Journal of Logic and Computation

Year: 2020 | Volume: 30, Issue: 1 | Journal Article |

Recent complexity-theoretic results on P systems with active membranes

;;;

Journal of Logic and Computation

Year: 2015 | Volume: 25, Issue: 4 | Journal Article |

Cited by: Papers (1)

Membrane systems, also called P systems, are an interesting class of parallel and distributed models of computation inspired by cell biology. They have been thoroughly investigated in the literature, both from the theoretical standpoint—analysing their computing power and efficiency—and as tools to model natural phenomena. In this article, we focus on the complexity theory of P systems with active...Show More

Recent complexity-theoretic results on P systems with active membranes

;;;

Journal of Logic and Computation

Year: 2015 | Volume: 25, Issue: 4 | Journal Article |

State Space Model Based VideoMAE Enhancement for Efficient Video Action Classification

Junbeom Moon;Sehwan Heo;Jiye Won;Jaeseok Jang;Soon Ki Jung

2025 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)

Year: 2025 | Conference Paper |

HTML

Video action classification is a critical task in computer vision, with applications spanning security surveillance, sports analytics, and human-computer interaction. Recent advancements, such as VideoMAE, have demonstrated the effectiveness of transformer-based architectures in learning spatiotemporal representations. However, their computational inefficiency, due to quadratic time complexity, li...Show More

State Space Model Based VideoMAE Enhancement for Efficient Video Action Classification

Junbeom Moon;Sehwan Heo;Jiye Won;Jaeseok Jang;Soon Ki Jung

2025 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)

Year: 2025 | Conference Paper |

Efficient Visual Tracking Using Local Information Patch Attention Free Transformer

Pin–Feng Wang;Chih–Wei Tang

2022 IEEE International Conference on Consumer Electronics - Taiwan

Year: 2022 | Conference Paper |

Cited by: Papers (1)

HTML

The state-of-the-art (SOTA) transformer tracker TransT achieves high tracking accuracy. Nevertheless, the time and space complexity of its attention operation is quadratic to the spatial dimension of feature vectors. Thus it is difficult to deploy TransT on resource constrained devices. This paper proposes Local Information Patch Attention Free Transformer (LIP-AFT) based Local Information Patch S...Show More

Efficient Visual Tracking Using Local Information Patch Attention Free Transformer

Pin–Feng Wang;Chih–Wei Tang

2022 IEEE International Conference on Consumer Electronics - Taiwan

Year: 2022 | Conference Paper |

An abstract to calculate big o factors of time and space complexity of machine code

;;

International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2011)

Year: 2011 | Conference Paper |

Cited by: Papers (19) | Patents (1)

Algorithms are generally written for solving some problems or mechanism through machines, the algorithms may be several in numbers, further to these the efficiency of the produced algorithms for the said issue need to be quantified: the factors which are to be quantified are time complexity, space complexity, administrative cost and faster implementation etc.,..One of the effective methods for stu...Show More

An abstract to calculate big o factors of time and space complexity of machine code

;;

International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2011)

Year: 2011 | Conference Paper |

Efficient bandwidth utilization using reserved bits of transmission control protocol header

;;

2nd Smart Cities Symposium (SCS 2019)

Year: 2019 | Conference Paper |

Internet has in a glimmer formed into a tremendous overall framework in the creating development. Transmission Control Protocol Suite is the major need for the time being's Internet. The exponential growth in the usage of the web can be easily observed. The Transmission Control Protocol suite has numerous arrangement deficiencies so far as Bandwidth use, Exchange Speed and congestion over the netw...Show More

Efficient bandwidth utilization using reserved bits of transmission control protocol header

;;

2nd Smart Cities Symposium (SCS 2019)

Year: 2019 | Conference Paper |

Fast Noise Suppression Algorithm with Kalman Filter Theory

Nari Tanabe;Toshihiro Furukawa;Shigeo Tsujii

2008 Second International Symposium on Universal Communication

Year: 2008 | Conference Paper |

Cited by: Papers (3)

HTML

We have proposed a robust noise suppression algorithm with Kalman filter theory. In this paper, we propose a Kalman filter based fast noise suppression algorithm for white and colored disturbance. The algorithm aims to achieve robust noise suppression with reduced computational complexity without sacrificing high quality of speech signal, by modifying the proposed canonical space model. We show th...Show More

Fast Noise Suppression Algorithm with Kalman Filter Theory

Nari Tanabe;Toshihiro Furukawa;Shigeo Tsujii

2008 Second International Symposium on Universal Communication

Year: 2008 | Conference Paper |

K-AP Clustering Algorithm for Large Scale Dataset

Chao Liu;Rosemary Hey;Wei Wang

2011 First International Workshop on Complexity and Data Mining

Year: 2011 | Conference Paper |

Cited by: Papers (1)

HTML

Affinity propagation clustering algorithm is with a broad value in science and engineering because of it no need to input the number of clusters in advances, robustness and good generalization. But the algorithm needs the initial similarity (the distance between any two points) as a parameter, a lot of time and storage space is required for the calculation of similarity. It's limited to apply to c...Show More

K-AP Clustering Algorithm for Large Scale Dataset

Chao Liu;Rosemary Hey;Wei Wang

2011 First International Workshop on Complexity and Data Mining

Year: 2011 | Conference Paper |

Fuse sort algorithm a proposal of divide & conquer based sorting approach with O(nloglogn) time and linear space complexity

Yashwant Singh Patel;Nitish Kumar Singh;Lalit Kumar Vashishtha

2014 International Conference on Data Mining and Intelligent Computing (ICDMIC)

Year: 2014 | Conference Paper |

Cited by: Papers (1)

HTML

Computational Complexity is a fundamental research area in the field of computer science. It has attracted lots of interest of various researchers. In past, vast number of sorting algorithms has been proposed by various researchers. To efficiently optimize any sorting problem having large number of elements requires O(nlogn) time in average case by existing sorting techniques. This paper presents ...Show More

Fuse sort algorithm a proposal of divide & conquer based sorting approach with O(nloglogn) time and linear space complexity

Yashwant Singh Patel;Nitish Kumar Singh;Lalit Kumar Vashishtha

2014 International Conference on Data Mining and Intelligent Computing (ICDMIC)

Year: 2014 | Conference Paper |

The capability spaces complexity measure method of Weapon System of Systems

Qingsong Zhao;Weitao Hu;Boyuan Xia;Junyi Ding;Mengjun Li

2020 IEEE International Systems Conference (SysCon)

Year: 2020 | Conference Paper |

Cited by: Papers (2)

HTML

The weapon system of systems (WSoS) is a complex system composed of independent systems. The capability of WSoS is the ability of the WSoS to accomplish its specific mission. As the scale of the WSoS continues to increase and the types of systems included continue to rise, the capabilities of the WSoS become more and more complex. The measurement of the complexity of the capabilities of the WSoS i...Show More

The capability spaces complexity measure method of Weapon System of Systems

Qingsong Zhao;Weitao Hu;Boyuan Xia;Junyi Ding;Mengjun Li

2020 IEEE International Systems Conference (SysCon)

Year: 2020 | Conference Paper |

Algorithm Development Analysis: searching and sorting

Vanam Chandana;Guvvala Tejaswini;Lalita Gupta;R.N. Yadav

2022 IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS)

Year: 2022 | Conference Paper |

Cited by: Papers (1)

HTML

The Development and analysis of algorithms are fundamental to all aspects of problem-solving: artificial intelligence, neural networks, fuzzy approaches, networking, operating systems, etc. It requires an understanding of the alternative solutions available for solving a computational problem, including the performance constraints accompanying a particular solution. It also involves an understandi...Show More

Algorithm Development Analysis: searching and sorting

Vanam Chandana;Guvvala Tejaswini;Lalita Gupta;R.N. Yadav

2022 IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS)

Year: 2022 | Conference Paper |

Differentiating Systematic Cyber Attacks from Random Attacks in Space Communication

Hacer Varol;Timothy W. Kaufman

2023 11th International Symposium on Digital Forensics and Security (ISDFS)

Year: 2023 | Conference Paper |

HTML

Cyberattacks can be conducted while a transmission is in progress between the sender and receiver. Prevention for each attack requires a different set of approaches and techniques. However, one area that is not explored enough is to automatically differentiate space network attacks as systematic or random. The Lempel-Ziv (LZ) algorithm is known as one of the eminent methods to detect errors depend...Show More

Differentiating Systematic Cyber Attacks from Random Attacks in Space Communication

Hacer Varol;Timothy W. Kaufman

2023 11th International Symposium on Digital Forensics and Security (ISDFS)

Year: 2023 | Conference Paper |

Mining visual complexity of images based on an enhanced feature space representation

Abdullah M. Iliyasu;Awad Kh. Al-Asmari;Mohamed A. AbdelWahab;Ahmed S. Salama;Mohamed A. Al-Qodah;Asif R. Khan;Phuc Q. Le;Fei Yan

2013 IEEE 8th International Symposium on Intelligent Signal Processing

Year: 2013 | Conference Paper |

Cited by: Papers (3)

HTML

An enhanced feature space to represent visual complexity of images, as would the HVS, is presented. Specifically, the ratio between the coherent and incoherent pixels in an image was used as a measure of the chromatic contributions to the visual complexity of an image. Similarly, the contrast, energy, entropy and homogeneity were modelled as the textural attributes of an image's visual complexity....Show More

Mining visual complexity of images based on an enhanced feature space representation

Abdullah M. Iliyasu;Awad Kh. Al-Asmari;Mohamed A. AbdelWahab;Ahmed S. Salama;Mohamed A. Al-Qodah;Asif R. Khan;Phuc Q. Le;Fei Yan

2013 IEEE 8th International Symposium on Intelligent Signal Processing

Year: 2013 | Conference Paper |

Analysis on Bubble Sort Algorithm Optimization

2010 International Forum on Information Technology and Applications

Year: 2010 | Conference Paper |

Cited by: Papers (18)

HTML

Based on the analysis of the traditional bubble sort algorithm, this paper proposes two bidirectional bubble sort algorithm design ideas. After giving C language description of the three algorithms, the paper tests the new algorithms, analyzes comparatively the time complexity and space complexity of the three algorithms, and summarizes such a conclusion that the first new algorithm has the same a...Show More

Analysis on Bubble Sort Algorithm Optimization

2010 International Forum on Information Technology and Applications

Year: 2010 | Volume: 1 | Conference Paper |

New Reed-Solomon Codes with All XOR Operation for Better En/Decoding Performance

Gefeng Deng;Zhengyi Jiang;Bo Bai;Gong Zhang;Xiuyin Zhang;Hanxu Hou

2024 IEEE Information Theory Workshop (ITW)

Year: 2024 | Conference Paper |

HTML

Reed-Solomon (RS) codes are widely used in storage systems to ensure data reliability. In this paper, we first propose a new construction of RS codes with between three to five parity symbols over a special finite field of size 256. We show that all the operations involved in the encoding/decoding process can be implemented by XOR and cyclic shift. Second, we present a fast encoding/decoding algor...Show More

New Reed-Solomon Codes with All XOR Operation for Better En/Decoding Performance

Gefeng Deng;Zhengyi Jiang;Bo Bai;Gong Zhang;Xiuyin Zhang;Hanxu Hou

2024 IEEE Information Theory Workshop (ITW)

Year: 2024 | Conference Paper |

Space Complexity Analysis in Hybrid Principal Component Analysis

Tapan Kumar Sahoo;Haider Banka;Atul Negi

2020 IEEE-HYDCON

Year: 2020 | Conference Paper |

Cited by: Papers (1)

HTML

Conventional linear PCA approaches do not adequately handle the issues such as intrinsic spatial structural information of pattern, the complexity of calculating covariance matrix, variations restricted to some parts of a pattern, and small sample size problem, etc. To handle the above challenges, several PCAs in feature partitioning framework have been developed to improve the recognition accurac...Show More

Space Complexity Analysis in Hybrid Principal Component Analysis

Tapan Kumar Sahoo;Haider Banka;Atul Negi

2020 IEEE-HYDCON

Year: 2020 | Conference Paper |

Optimizing Space and Time Complexity for IoT Infused Health Monitoring System

Amey V. Chougule;Sharwari M. Kale;Ritesh C. Ghodgire;Sanjana R. Bailakkanavar;Gujanatti Rudrappa;Arun Tigadi

2024 1st International Conference on Advances in Computing, Communication and Networking (ICAC2N)

Year: 2024 | Conference Paper |

HTML

This paper describes a unique IoT-infused health monitoring system based on the ESP32 microcontroller, which is meant to capture and transmit real-time health parameters such as SpO2, body temperature, pulse rate, and electrocardiogram. The system integrates MAX30100 for SPO2 and pulse oximetry, DS18B20 for temperature sensing, and AD8232 for ECG monitoring, ensuring continuous data collection. Th...Show More

Optimizing Space and Time Complexity for IoT Infused Health Monitoring System

Amey V. Chougule;Sharwari M. Kale;Ritesh C. Ghodgire;Sanjana R. Bailakkanavar;Gujanatti Rudrappa;Arun Tigadi

2024 1st International Conference on Advances in Computing, Communication and Networking (ICAC2N)

Year: 2024 | Conference Paper |

Super Sort Sorting Algorithm

2018 3rd International Conference for Convergence in Technology (I2CT)

Year: 2018 | Conference Paper |

Cited by: Papers (5)

HTML

Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms. The sorting technique presented in this paper makes use of the natural sequence of sorted elements in an arra...Show More

Super Sort Sorting Algorithm

2018 3rd International Conference for Convergence in Technology (I2CT)

Year: 2018 | Conference Paper |

Complexity enabled design space exploration

S. Tamaskar;K. Neema;T. Kotegawa;D. DeLaurentis

2011 IEEE International Conference on Systems, Man, and Cybernetics

Year: 2011 | Conference Paper |

Cited by: Papers (6)

HTML

The proposed paper presents a framework for complexity enabled design space exploration. A circuit problem is introduced where different designs are generated from a component library to create a low pass filter circuit. Performance and complexity metrics are defined to measure the fitness of the design. A scheme for complexity enabled design space exploration is introduced and the results obtaine...Show More

Complexity enabled design space exploration

S. Tamaskar;K. Neema;T. Kotegawa;D. DeLaurentis

2011 IEEE International Conference on Systems, Man, and Cybernetics

Year: 2011 | Conference Paper |

Modified EEA3 algorithm with improved throughput performance

Shri Ramtej Kondamuri;Nitish Kumar Gupta;Rakesh Sharma

2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT)

Year: 2014 | Conference Paper |

HTML

EEA3 (Evolved Packet System Encryption Algorithm 3) is a confidentiality algorithm that is used to en/decrypt blocks of data under a confidentiality key. From analytical evaluation EEA3 algorithm has linear time complexity and linear space complexity. The performance of this EEA3 algorithm can be evaluated from this time and space complexities. In this paper a small modification is made to EEA3 al...Show More

Modified EEA3 algorithm with improved throughput performance

Shri Ramtej Kondamuri;Nitish Kumar Gupta;Rakesh Sharma

2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT)

Year: 2014 | Conference Paper |

Deep Learning Model for Recognition of Handwritten Devanagari Numerals With Low Computational Complexity and Space Requirements

Danveer Rajpal;Akhil Ranjan Garg

Year: 2023 | Volume: 11 | Journal Article |

Cited by: Papers (4)

HTML

The broad application area and accompanying challenges make machine learning-based recognition of handwritten scripts a demanding field. Individuals’ writing practices and inherent variations in the size, shape, and tilt of characters may increase the difficulty level. Deep convolutional neural network (DCNN) models have been successful in solving pattern recognition problems, but at the expense o...Show More

Deep Learning Model for Recognition of Handwritten Devanagari Numerals With Low Computational Complexity and Space Requirements

Danveer Rajpal;Akhil Ranjan Garg

Year: 2023 | Volume: 11 | Journal Article |

Mid–Point Sorting Algorithm:A New Way to Sort

Anjali Garg;Varun Patel;Divya Mishra

2022 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES)

Year: 2022 | Conference Paper |

HTML

In today’s era, one of the primary and crucial issues in computer science is all about systematic ordering of a set of items. Ordering forms a fundamental operation in different practical fields of Computer Sciences, Database Applications, Networks and Artificial Intelligence, etc. thereby attracting a massive amount of research in this field. Although, there exist a huge number of sorting algorit...Show More

Mid–Point Sorting Algorithm:A New Way to Sort

Anjali Garg;Varun Patel;Divya Mishra

2022 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES)

Year: 2022 | Conference Paper |

Time and Space Optimization in Linear Time Sorting Using LSORT

Yendeti Lalith Narayanan;Sumathi M

2024 2nd International Conference on Networking and Communications (ICNWC)

Year: 2024 | Conference Paper |

HTML

The requirement for faster computation is increasing day by day, and researchers are working hard to improve processing speed in different aspects. In real time, the data elements are collected in an unsorted manner. Unsorted-data processing takes more processing time. Thus, one of the most important steps in reducing processing times when dealing with big data sets is sorting. For sorting element...Show More

Time and Space Optimization in Linear Time Sorting Using LSORT

Yendeti Lalith Narayanan;Sumathi M

2024 2nd International Conference on Networking and Communications (ICNWC)

Year: 2024 | Conference Paper |

Polynomial Formal Verification of KFDD Circuits

Martha Schnieber;Rolf Drechsler

2023 21st ACM-IEEE International Symposium on Formal Methods and Models for System Design (MEMOCODE)

Year: 2023 | Conference Paper |

Cited by: Papers (3)

HTML

As the complexity of digital circuits increases, their verification poses an increasingly difficult challenge. Simulation techniques cannot fully guarantee the correctness of a circuit and thus, formal verification techniques (such as BDDs or SAT) have to be used. However, their application can generally require exponential time and space. Consequently, the verification complexity of several circu...Show More

Polynomial Formal Verification of KFDD Circuits

Martha Schnieber;Rolf Drechsler

2023 21st ACM-IEEE International Symposium on Formal Methods and Models for System Design (MEMOCODE)

Year: 2023 | Conference Paper |

Double Hashing Sort Algorithm

Yasser M.K. Omar;Hoda Osama;Amr Badr

Computing in Science & Engineering

Year: 2017 | Volume: 19, Issue: 2 | Magazine Article |

Cited by: Papers (7)

HTML

In the past few years, researchers have introduced several sorting algorithms to enhance time complexity, space complexity, and stability. A double hashing methodology first collects statistics about element distribution and then maps between elements of the array and indexes based on the knowledge collected during the first hashing.Show More

Double Hashing Sort Algorithm

Yasser M.K. Omar;Hoda Osama;Amr Badr

Computing in Science & Engineering

Year: 2017 | Volume: 19, Issue: 2 | Magazine Article |

Standards Dictionary Terms

concept phase
defect
error
failure
fault
measure
primitive
software reliability
software reliability management

IEEE Personal Account

Change username/password

Purchase Details

Payment Options
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

Follow

About IEEE Xplore | Contact Us | Help | Accessibility | Terms of Use | Nondiscrimination Policy | IEEE Ethics Reporting | Sitemap | IEEE Privacy Policy

A public charity, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

© Copyright 2025 IEEE - All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies.

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

About IEEE Xplore
Contact Us
Help
Accessibility
Terms of Use
Nondiscrimination Policy
Sitemap
Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Test Whats new message.