New kth-shortest path algorithm

H. Maruyama

IEICE Transactions on Information and Systems

Paper

01 Mar 1993

New kth-shortest path algorithm

Abstract

This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.

Demo paper

SupervisorBot: NLP-Annotated Real-Time Recommendations of Psychotherapy Treatment Strategies with Deep Reinforcement Learning

Baihan Lin, Guillermo Cecchi, et al.

IJCAI 2023

Conference paper

Kernel spectral clustering for predicting maintenance of industrial machines

Rocco Langone, Carlos Alzate, et al.

SSCI 2013

Paper

Compression in the presence of shared data

Michael Factor, Dafna Sheinwald

Information Sciences

Conference paper

Trimming the ₁ regularizer: Statistical analysis, optimization, and applications to deep learning

Jihun Yun, Peng Zheng, et al.

ICML 2019

View all publications

Abstract

Related

SupervisorBot: NLP-Annotated Real-Time Recommendations of Psychotherapy Treatment Strategies with Deep Reinforcement Learning

Kernel spectral clustering for predicting maintenance of industrial machines

Compression in the presence of shared data

Trimming the 1 regularizer: Statistical analysis, optimization, and applications to deep learning

Trimming the ₁ regularizer: Statistical analysis, optimization, and applications to deep learning