Sciweavers

3471 search results - page 273 / 695
» Obstacle Numbers of Graphs
Sort
View
ATMOS
2010
150views Optimization» more  ATMOS 2010»
15 years 5 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
ACL
2010
15 years 4 months ago
Learning Lexicalized Reordering Models from Reordering Graphs
Lexicalized reordering models play a crucial role in phrase-based translation systems. They are usually learned from the word-aligned bilingual corpus by examining the reordering ...
Jinsong Su, Yang Liu, Yajuan Lü, Haitao Mi, Q...
ICASSP
2011
IEEE
14 years 10 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
JCT
2007
107views more  JCT 2007»
15 years 6 months ago
On a conjecture of Wilf
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
Stefan De Wannemacker, Thomas Laffey, Robert Osbur...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...