We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...
More and more data mining algorithms are applied to a large number of long time series issued by many distributed sensors. The consequence of the huge volume of data is that data ...
Raja Chiky, Laurent Decreusefond, Georges Hé...
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...