87 search results - page 10 / 18 » arcs 2004 |
119
Voted
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
135
Voted
CAD
2004
Springer
15 years 3 months ago
2004
Springer
We present an efficient geometric algorithm for conic spline curve fitting and fairing through conic arc scaling. Given a set of planar points, we first construct a tangent contin...
117
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
102
Voted
CPM
2004
Springer
15 years 9 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
106
Voted
ICCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...