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

Steven Ly

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

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Human-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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › reranking
diffusion-based re-ranking
0.412019
Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing · AAAI 2019
Information retrieval
efficient retrieval
0.412019
Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing · AAAI 2019
Information retrieval › retrieval models
ranked retrieval
0.412019
Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing · AAAI 2019

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

late truncation · 0.4kNN search · 0.4diffusion · 0.4
YearPublicationVenuePosition
2019 Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing
abstract
Diffusion is commonly used as a ranking or re-ranking method in retrieval tasks to achieve higher retrieval performance, and has attracted lots of attention in recent years. A downside to diffusion is that it performs slowly in comparison to the naive k-NN search, which causes a non-trivial online computational cost on large datasets. To overcome this weakness, we propose a novel diffusion technique in this paper. In our work, instead of applying diffusion to the query, we precompute the diffusion results of each element in the database, making the online search a simple linear combination on top of the k-NN search process. Our proposed method becomes 10∼ times faster in terms of online search speed. Moreover, we propose to use late truncation instead of early truncation in previous works to achieve better retrieval performance.
Fan Yang 0038, Ryota Hinami, Yusuke Matsui 0001, Steven Ly, Shin'ichi Satoh 0001
AAAI4
2018 NADiA: Neural Network Driven Virtual Human Conversation Agents
abstract
Advances in artificial intelligence and in particular machine learning and neural networks have given rise to a new generation of virtual assistants and chatbots. Within this work, we present NADiA - Neurally Animated Dialog Agent - that leverages both the user's verbal input as well as their facial expressions to respond in a meaningful way. NADiA combines a neural language model that generates appropriate responses to user prompts, a convolutional neural network for facial expression analysis, and virtual human technology that is deployed on a mobile phone. Here, we evaluate NADiA's anthropomorphic characteristics and its ability to understand the human interlocutor using both subjective as well as objective measures. We find that NADiA significantly outperforms state of the art chatbot technology and produces comparable behavior to human generated reference outputs.
Jason Wu 0001, Sayan Ghosh 0004, Mathieu Chollet, Steven Ly, Sharon Mozgai, Stefan Scherer
IVA4