1522 search results - page 50 / 305 » On the Complexity of Several Haplotyping Problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
ALGORITHMICA
2008
13 years 7 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
PROMISE
2010
13 years 2 months ago
2010
Background. Currently there are several definitions of measures that should represent the size of software functional requirements. These measures have gained a quite relevant rol...