1884 search results - page 129 / 377 » Simple Algorithm for Simple Timed Games |
109
click to vote
ISMIR
2005
Springer
15 years 8 months ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...
111
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
194
Voted
WABI
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
156
click to vote
HEURISTICS
2010
14 years 11 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
120
click to vote
ACMSE
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...