Sciweavers

24 search results - page 1 / 5
» Extending Pattern Branching to Handle Challenging Instances
Sort
View
BIBE
2006
IEEE
14 years 4 months ago
Extending Pattern Branching to Handle Challenging Instances
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...
Jaime Davila, Sanguthevar Rajasekaran
TSD
2004
Springer
14 years 4 months ago
Handling Multi-word Expressions Without Explicit Linguistic Rules in an MT System
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 ...
Akshar Bharati, Rajeev Sangal, Dipti Mishra, Srira...
IROS
2007
IEEE
176views Robotics» more  IROS 2007»
14 years 5 months ago
Handling uncertainty in semantic-knowledge based execution monitoring
— 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...
Abdelbaki Bouguerra, Lars Karlsson, Alessandro Saf...
AIPS
2008
14 years 1 months ago
Planning for Modular Printers: Beyond Productivity
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 ...
Minh Binh Do, Wheeler Ruml, Rong Zhou
DASFAA
2007
IEEE
220views Database» more  DASFAA 2007»
14 years 5 months ago
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
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...
Zhenglu Yang, Yitong Wang, Masaru Kitsuregawa