2192 search results - page 223 / 439 » Algorithms for Challenging Motif Problems |
142
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
155
click to vote
GPEM
2006
15 years 4 months ago
2006
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
112
click to vote
KAIS
2006
15 years 4 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
137
click to vote
PR
2008
15 years 4 months ago
2008
Hundreds of millions of users each day submit queries to the Web search engine. The user queries are typically very short which makes query understanding a challenging problem. In...
154
click to vote
TCSV
2008
15 years 4 months ago
2008
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...