138 search results - page 11 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
93
Voted
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
83
Voted
EUSFLAT
2003
15 years 1 months ago
2003
In this paper, a modified fuzzy system modelling algorithm that incorporates Type 2 fuzzy sets, which is based on intervalvalued membership degrees rather than singleton membershi...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
95
Voted
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
87
Voted
JMLR
2010
14 years 6 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...