2766 search results - page 383 / 554 » Algorithms for trigonometric polynomials |
160
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
119
click to vote
WABI
2007
Springer
15 years 10 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
137
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
152
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
128
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...