Sciweavers

1651 search results - page 216 / 331
» Measuring the Complexity of Classification Problems
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
13 years 8 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
INFOCOM
2008
IEEE
14 years 2 months ago
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
Bin Chang, Yi Cui, Yuan Xue
STACS
1999
Springer
14 years 14 days ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
FOCS
1993
IEEE
14 years 10 days ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
AAAI
2008
13 years 10 months ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...