409 search results - page 27 / 82 » Matching Scenarios with Timing Constraints |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
GIS
2009
ACM
14 years 8 months ago
2009
ACM
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...