656 search results - page 34 / 132 » Graph Theoretical Characterization and Computation of Answer... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
GD
2003
Springer
14 years 24 days ago
2003
Springer
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Analytic manifolds were recently used for motion averaging, segmentation and robust estimation. Here we consider the epipolar constraint for calibrated cameras, which is the most ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...