Sciweavers

Share
3 search results - page 1 / 1
» Online Dial-A-Ride Problem with Time Windows: An Exact Algor...
Sort
View
OR
2006
Springer
11 years 8 months ago
Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors
The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the ...
Anke Fabri, Peter Recht
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
12 years 4 days ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
CIKM
2009
Springer
12 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
books