2060 search results - page 218 / 412 » Some Applications of Coding Theory in Computational Complexi... |
123
click to vote
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
113
Voted
ICONIP
2007
14 years 11 months ago
2007
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case...
DIGRA
2005
Springer
15 years 3 months ago
2005
Springer
Although emotions elicited by the fictional world or the artefact play a part in story-driven video games, they are certainly not the focus of the experience. From a cognitive psy...
74
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
78
Voted
LATA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...