24 search results - page 1 / 5 » Extending Pattern Branching to Handle Challenging Instances |
BIBE
2006
IEEE
13 years 11 months ago
2006
IEEE
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
TSD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Translation of Multi-word expressions (MWEs) is one of the most challenging tasks of a Machine translation (MT) system. In this paper, we present an innovative technique ...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Executing plans by mobile robots, in real world environments, faces the challenging issues of uncertainty and environment dynamics. Thus, execution monitoring is needed to veri...
AIPS
2008
13 years 7 months ago
2008
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution ...
DASFAA
2007
IEEE
2007
IEEE
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
13 years 11 months ago
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...