1144 search results - page 93 / 229 » Feasibility Studies |
109
Voted
ISMIR
2003
Springer
15 years 6 months ago
2003
Springer
In this paper we examine the retrieval performance of adjacent and concurrent n-grams generated from polyphonic music data. We deploy a method to index polyphonic music using a wo...
113
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a...
109
click to vote
DSD
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper1 addresses the hardware implementation of a dynamic scheduler for non-manifest data dependent periodic loops. Static scheduling techniques which are known to give near ...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...
106
click to vote
FUZZY
2001
Springer
15 years 5 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...