Sciweavers

1632 search results - page 163 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
ICST
2009
IEEE
15 years 1 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
16 years 5 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
AIPS
2010
15 years 6 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
16 years 5 months ago
Stream Monitoring under the Time Warping Distance
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...
Yasushi Sakurai, Christos Faloutsos, Masashi Yamam...
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 8 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth