2446 search results - page 314 / 490 » Choiceless Polynomial Time |
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
RSA
2010
13 years 6 months ago
2010
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
TCBB
2010
13 years 6 months ago
2010
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...
TCS
2010
13 years 6 months ago
2010
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...