1461 search results - page 208 / 293 » Complexity of Graph Covering Problems |
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
PPSN
1992
Springer
14 years 29 days ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
IJON
2006
13 years 9 months ago
2006
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
SIGGRAPH
2009
ACM
14 years 3 months ago
2009
ACM
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
BMCBI
2006
13 years 9 months ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...