353 search results - page 23 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
SWAT
1998
Springer
14 years 26 days ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
ICFEM
2000
Springer
14 years 8 days ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
JIPS
2008
13 years 8 months ago
2008
: This paper deals with the geometric fitting algorithms for parametric curves and surfaces in 2-D/3-D space, which estimate the curve/surface parameters by minimizing the square s...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...