1055 search results - page 43 / 211 » Enumerations in computable structure theory |
TVCG
2010
13 years 8 months ago
2010
—Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, ...
GBRPR
2009
Springer
13 years 8 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
COMPLEX
2009
Springer
14 years 4 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
STACS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
IJAC
2002
13 years 10 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...