541 search results - page 54 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
ERSHOV
2009
Springer
14 years 18 days ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
CIKM
2006
Springer
14 years 14 days ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
EOR
2002
13 years 8 months ago
2002
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
DMIN
2008
13 years 10 months ago
2008
Abstract - The rapid advances of wireless and web technologies enable the mobile users to request various kinds of services via mobile devices at anytime and anywhere. To provide t...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...