1522 search results - page 159 / 305 » On the Complexity of Several Haplotyping Problems |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— Consider the situation in which a decision maker (Actor) has to decide which of several available resources to use in the presence of an adversary (called Controller) that can ...
106
click to vote
DASFAA
2007
IEEE
15 years 4 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
ITNG
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
APN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
In the last few years, several algorithms for the automatic alignment of audio and score data corresponding to the same piece of music have been proposed. Among the major drawback...