2 papers
cs.DS2023
Nearly Work-Efficient Parallel DFS in Undirected Graphs
Mohsen Ghaffari, Christoph Grunau, Jiahao Qu
We present the first parallel depth-first search algorithm for undirected graphs that has near-linear work and sublinear depth. Concretely, in any -node -edge undirected grap…
cs.CL2019
Topic-aware chatbot using Recurrent Neural Networks and Nonnegative Matrix Factorization
Yuchen Guo, Nicholas Hanoian, Zhexiao Lin +8
We propose a novel model for a topic-aware chatbot by combining the traditional Recurrent Neural Network (RNN) encoder-decoder model with a topic attention layer based on Nonnegati…