845 search results - page 18 / 169 » Complexity Dimensions and Learnability |
CG
2011
Springer
12 years 11 months ago
2011
Springer
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
ZEUS
2010
13 years 8 months ago
2010
Enterprise-wide process harmonisation initiatives require the analysis of commonalities of existing business process models. That is, correspondences between activities are identif...
JCT
2007
13 years 7 months ago
2007
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimen...