3678 search results - page 399 / 736 » On the Stable Paths Problem |
191
click to vote
CHI
2011
ACM
14 years 10 months ago
2011
ACM
While usability methods such as user studies and inspections can reveal a wide range of problems, they do so for only a subset of an application’s features and states. We presen...
215
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
203
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
183
click to vote
ICDM
2005
IEEE
16 years 10 days ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
158
click to vote
SWAT
2004
Springer
16 years 2 days ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...