Sciweavers

313 search results - page 49 / 63
» Shortest Paths in Distance-regular Graphs
Sort
View
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 9 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
STACS
2000
Springer
13 years 11 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...
NAACL
2007
13 years 9 months ago
Are Very Large N-Best Lists Useful for SMT?
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...
Sasa Hasan, Richard Zens, Hermann Ney
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
13 years 7 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 1 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail