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.

Fengming Wang

dblp:34/3513 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
1since 2021 · last 2026
—ORCID · conflict

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

Theory of computation · 8 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1

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.

Theoretical computer science
3 papers
Computational complexity · 73% Coding theory · 18% Combinatorics and discrete mathematics · 9%

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

TopicWeightPapersLastEvidence papers
Computational complexity
kolmogorov complexity
0.222011
Extracting Kolmogorov complexity with applications to dimension zero-one laws · Inf. Comput. 2011
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws · ICALP (1) 2006
Computational complexity › structural complexity
resource-bounded measure
0.222011
Extracting Kolmogorov complexity with applications to dimension zero-one laws · Inf. Comput. 2011
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws · ICALP (1) 2006
Computational complexity › algebraic complexity
algebraic branching program
0.112011
On the Power of Algebraic Branching Programs of Width Two · ICALP (1) 2011
Coding theory
dimension
0.112011
Extracting Kolmogorov complexity with applications to dimension zero-one laws · Inf. Comput. 2011
Combinatorics and discrete mathematics › partial orders
dimension theory
0.112006
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws · ICALP (1) 2006

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

zero-one law · 0.1kolmogorov complexity · 0.1
YearPublicationVenuePosition
2026 A Virtual Instructor-Led System for Assessing and Guiding Middle School Physics Experiments
abstract
ABSTRACT Interactive computer technology is deeply integrated into traditional teaching methods. The traditional teaching of physics experiments in secondary schools suffers from the inability of teachers to provide timely guidance to students, the difficulty of controlling experimental variables, and the lack of uniformity in evaluation criteria. To address the aforementioned issues, we have developed an innovative system to improve secondary school physics education using computer vision‐based interaction with virtual humans and sensors. The proposed system captures experimental data in real time so that student performance can be accurately monitored and assessed. Teachers can effortlessly configure experiments through simple coding, while the system leverages a multimodal macrolanguage model to offer contextual feedback and guidance. The system generates a virtual teacher that offers step‐by‐step guidance and real‐time feedback. Usability tests indicate that the system significantly improves student engagement and comprehension of complex physics concepts, highlighting its potential to transform traditional science education. The advantage of real‐time assessment and guidance in secondary school physics experiments is that it enables students to grasp abstract concepts in a more intuitive and comprehensible manner.
Fengming Wang, Fuchang Liu
Comput. Animat. Virtual Worlds1
2016 On the power of algebraic branching programs of width two
Eric Allender, Fengming Wang
Comput. Complex.2
2016 Hellinger volume and number-on-the-forehead communication complexity
Troy Lee, Nikos Leonardos, Michael E. Saks, Fengming Wang
J. Comput. Syst. Sci.4
2011 On the Power of Algebraic Branching Programs of Width Two
Eric Allender, Fengming Wang
ICALP (1)2
2011 NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth
Fengming Wang
TAMC1
2011 Extracting Kolmogorov complexity with applications to dimension zero-one laws
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
Inf. Comput.5
2010 Uniform Derandomization from Pathetic Lower Bounds
Eric Allender, Vikraman Arvind, Fengming Wang
APPROX-RANDOM3
2007 Robustness of PSPACE-complete sets
Aduri Pavan, Fengming Wang
Inf. Process. Lett.2
2006 Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
ICALP (1)5
1990 Time-recursive deinterlacing for IDTV and pyramid coding
abstract
Most improved definition television (IDTV) receivers use progressive scanning to reduce artifacts associated with interlacing (e.g. interline flicker, line crawl, etc). We propose some novel techniques of motion compensated interpolation of the missing lines of interlaced monochrome and color sequences, reducing the artifacts associated with interlacing, and effectively increasing the vertical resolution of the image sequences. Time-recursive motion compensated prediction is introduced, in which all previously displayed history (not just the previous field) is used to predict the missing pixel values. The next future field is also used for the same purpose, by a look-ahead scheme. Motion estimation is done using a quadtree-based segmented block-matching technique with half pixel accuracy. To avoid artifacts and obtain full resolution in still regions, like background, motion adaptation is used as well. We also discuss how to apply this algorithm to pyramid coding to achieve better compression rate and compatibility of progressive with interlaced format standards.
Fengming Wang, Dimitris Anastassiou, Arun N. Netravali
Signal Process. Image Commun.1