2031 search results - page 106 / 407 » On Tree-Constrained Matchings and Generalizations |
167
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
CIVR
2009
Springer
15 years 4 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
PETRA
2009
ACM
15 years 4 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
FPGA
2007
ACM
15 years 4 months ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...