Sciweavers

580 search results - page 52 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 2 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
222
Voted
GIS
2004
ACM
16 years 3 months ago
Efficient detection of motion patterns in spatio-temporal data sets
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...
210
Voted
GIS
2007
ACM
16 years 3 months ago
Dynamics-aware similarity of moving objects trajectories
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Robe...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 6 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
BMCBI
2010
117views more  BMCBI 2010»
15 years 2 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski