224 search results - page 29 / 45 » Homogeneous Decomposition of Polynomials |
131
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
137
Voted
ALGORITHMICA
2007
15 years 3 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
146
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
143
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
122
click to vote
IPPS
2010
IEEE
15 years 25 days ago
2010
IEEE
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria tog...