Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Weidong Hao

dblp:96/703 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
3D vision · 50% Knowledge representation and reasoning · 50%
Computer graphics and multimedia
1 paper
Computational photography and imaging · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
event-based vision
0.912025
EventPillars: Pillar-based Efficient Representations for Event Data · AAAI 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › reasoning about action and change
event representation
0.912025
EventPillars: Pillar-based Efficient Representations for Event Data · AAAI 2025
Computational photography and imaging
event camera
0.912025
EventPillars: Pillar-based Efficient Representations for Event Data · AAAI 2025

Methods — techniques the papers use, named apart from their topics

spatial attention · 1.7pillar-based representation · 1.7
YearPublicationVenuePosition
2025 EventPillars: Pillar-based Efficient Representations for Event Data
abstract
Event Cameras offer appealing advantages, including power efficiency and ultra-low latency, driving forward advancements in edge applications. In order to leverage mature frame-based algorithms, most approaches typically compute dense, image-like representations from sparse, asynchronous events. However, they are often unable to capture comprehensive information or are computationally intensive, which hinders the edge deployment of event-based vision. Meanwhile, pillar-based paradigms have been proven to be efficient and well established for dense representations of sparse data. Hence, from a novel pillar-based perspective, we present EventPillars, an efficient, comprehensive framework for dense event representations. To summarize, it (i) incorporates the Temporal Event Range to describe an intact temporal distribution, (ii) Activates the Event Polarities to explicitly record the scene dynamics, (iii) enhances the target awareness by a spatial attention prior from Normalized Event Density, (iv) can be plug-and-played into different downstream tasks. Extensive experiments show that our EventPillars records a new state-of-the-art precision on object recognition and detection datasets with surprisingly 9.2× and 4.5× lower computation and storage consumption. This brings a new insight into dense event representations and is promising to boost the edge deployment of event-based vision.
Rui Fan 0001, Weidong Hao, Juntao Guan, Lai Rui, Lin Gu 0003, Fanhong Zeng, Zhangming Zhu
AAAI2
2006 QoS-aware Scheduling Algorithm Based on Complete Matching of User Jobs and Grid Services
abstract
Grid services scheduling is a challenging problem under open grid service architecture (OGSA). Grid services running on clusters must have mechanism and policies for establishing and supporting QoS. A graph theory formal description is introduced into the service grid model in this paper. The necessary and sufficient condition of complete matching of user job and service resources has been given and proved. Optimal solution to matchmaking of grid jobs and grid services is developed based on the running time weight matrix, and the arithmetic has been verified by simulation analysis which proved to be more efficient than the alike arithmetic. The arithmetic has been implemented and running well
Weidong Hao, Yang Yang 0004, Chuang Lin 0002, Zhengli Zhai
APSCC1