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

Do C and Java programs scale differently on Hardware Transactional Memory?

Rei Odaira, Jose G. Castanos, et al.

IISWC 2013

Conference paper

Practicing the best practice: Designing effective health care experiences

Susan L. Spraragen

International Conference on Design and Emotion 2010

Paper

Unsupervised lexicon induction for clause-level detection of evaluations

Hiroshi Kanayama, Tetsuya Nasukawa

Natural Language Engineering

Conference paper

From modern standard Arabic to Levantine ASR: Leveraging GALE for dialects

Hagen Soltau, Lidia Mangu, et al.

ASRU 2011

View all publications

Abstract

Related

Do C and Java programs scale differently on Hardware Transactional Memory?

Practicing the best practice: Designing effective health care experiences

Unsupervised lexicon induction for clause-level detection of evaluations

From modern standard Arabic to Levantine ASR: Leveraging GALE for dialects