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.

Jihong Ou

dblp:46/1670 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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
1 paper
Mathematical optimization · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
heuristic algorithms
0.011998
Multi-Item Inventory Staggering Problems: Heuristic and Bounds · SODA 1998
Mathematical optimization
inventory management
0.011998
Multi-Item Inventory Staggering Problems: Heuristic and Bounds · SODA 1998
YearPublicationVenuePosition
2005 Data prefetching for smooth navigation of large scale JPEG 2000 images
abstract
Remote access to large scale images arouses a growing interest in fields such as medical imagery or remote sensing. This raises the need for algorithms guaranteeing navigation smoothness while minimizing the network resources used. In this paper, we present a model taking advantage of the JPEG 2000 scalability combined with a prefetching policy. The model uses the last user action to efficiently manage the cache and to prefetch the most probable data to be used next. Three different network configurations are considered. In each case, comparison with two more classic policies shows the improvement brought by our approach.
Antonin Descampe, Jihong Ou, Philippe Chevalier, Benoît Macq
ICME2
1998 Multi-Item Inventory Staggering Problems: Heuristic and Bounds
Chung-Piaw Teo, Jihong Ou, Kok-Choon Tan
SODA2