EDBT 2026 Demo / reviewers in the wild / expert
Takayoshi Asakura
dblp:67/3381
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2022
0009-0009-5664-188XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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.
| Artificial intelligence
1 paper |
Representation and self-supervised learning · 50% Probabilistic and Bayesian machine learning · 50% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning
embedding learning |
0.6 | 1 | 2022 | Superclass-Conditional Gaussian Mixture Model For Learning Fine-Grained Embeddings · ICLR 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
gaussian mixture model |
0.6 | 1 | 2022 | Superclass-Conditional Gaussian Mixture Model For Learning Fine-Grained Embeddings · ICLR 2022 |
Methods — techniques the papers use, named apart from their topics
superclass conditioning · 0.6gaussian mixture model · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Superclass-Conditional Gaussian Mixture Model For Learning Fine-Grained Embeddings
Jingchao Ni, Wei Cheng 0002, Zhengzhang Chen, Takayoshi Asakura, Tomoya Soma, Sho Kato |
ICLR | 4 |
| 2013 | A Cache Replacement Method for Crowded Streaming Cache Servers Responding to Rapidly Changing Access PatternsabstractThe emergence of high quality video streaming services over the Internet has caused significant increases in the volume of traffic. Until now, cache technologies that have deployed frequently requested content in the proximity of users to mitigate traffic have been widely deployed on the Internet to improve user experiences and make them more effective. However, even when a cached object becomes a candidate for eviction due to lower access frequency, the object cannot be evicted since it is locked in working status until delivery is completed. This degrades the cache hit ratio and it has recently become much more common in high access traffic environments. This paper proposes a new method of replacing caches, called scheduled eviction of lingering caches (SELC). SELC selects an eviction candidate object based on replacement latency and shuts new access out by redirecting the access to an origin server so as to unlock the object by completing delivery for existing requests. Consequently, SELC can preserve cache space for emerging content. The results we obtained from simulations indicated that the proposed method could improve the cache hit ratio of crowded cache servers in an environment of rapidly changing access frequency. Toru Osuga, Takayoshi Asakura, Kunihiro Taniguchi |
AINA | 2 |
| 1997 | WorkWeb system - multi-workflow management with a multi-agent systemabstractCurrent office systems independently manage workflows and personal schedules. However, they cannot be managed independently, because of resource constraints. The "WorkWeb System" is an expanded workflow system that is able to manage and control office resources. The "BPT agent" in the system autonomously manages each workflow process instance, trying to acquire the necessary resources to complete it in time. The WorkWeb System also provides visual interfaces to manage and control office goals and several workflow re-planning algorithms to handle exceptional cases. This paper illustrates how the resource management and workflow dynamic scheduling are performed, and discusses issues involved with this system. Hiroyuki Tarumi, Koji Kida, Yoshihide Ishiguro, Kenji Yoshifu, Takayoshi Asakura |
GROUP | 5 |