281 search results - page 23 / 57 » The Complexity of Planar Counting Problems |
DISOPT
2010
13 years 7 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
ATMOS
2010
13 years 6 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
Detection of planar surfaces in a generic scene is difficult when the illumination is complex and less intense, and the surfaces have non-uniform colors (e.g., a movie poster). A...
IWPC
2010
IEEE
13 years 6 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...