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.

Conference paper

Low-loss heterogeneously integrated barium-titanate-on-silicon-nitride photonics

Annina Riedhauser, Viacheslav Snigirev, et al.

CLEO 2023

Paper

Compression in the presence of shared data

Michael Factor, Dafna Sheinwald

Information Sciences

Workshop paper

An ensemble of 3D U-Net based models for segmentation of kidney and masses in CT scans

Alex Golts, Daniel Khapun, et al.

MICCAI 2021

Demo paper

AutoTuneX: Interactive Automated Fine-Tuning for Large Language Models

Daniel Karl I. Weidele, Priyanshu Rai, et al.

AAAI 2026

View all publications

Abstract

Related

Low-loss heterogeneously integrated barium-titanate-on-silicon-nitride photonics

Compression in the presence of shared data

An ensemble of 3D U-Net based models for segmentation of kidney and masses in CT scans

AutoTuneX: Interactive Automated Fine-Tuning for Large Language Models