1209 search results - page 214 / 242 » Universal Algebra and Computer Science |
AIMSA
2010
Springer
13 years 10 months ago
2010
Springer
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
FQ
2003
Springer
14 years 1 months ago
2003
Springer
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...