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.

Short paper

Enterprise Benchmarks for Large Language Model Evaluation

Bing Zhang, Mikio Takeuchi, et al.

NAACL 2025

Conference paper

One-Class Conditional Random Fields for sequential anomaly detection

Yale Song, Zhen Wen, et al.

IJCAI 2013

Paper

Changing computing paradigms towards power efficiency

Pavel Klavík, A. Cristiano I. Malossi, et al.

Philos. Trans. R. Soc. A

Paper

Decision tree-based acoustic models for speech recognition with improved smoothness

Masami Akamine, Jitendra Ajmera

IEICE Trans Inf Syst

View all publications

Abstract

Related

Enterprise Benchmarks for Large Language Model Evaluation

One-Class Conditional Random Fields for sequential anomaly detection

Changing computing paradigms towards power efficiency

Decision tree-based acoustic models for speech recognition with improved smoothness