4961 search results - page 286 / 993 » Homomorphism-Homogeneous Relational Structures |
125
click to vote
NDJFL
1998
15 years 3 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
144
click to vote
TC
2002
15 years 3 months ago
2002
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
132
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
117
click to vote
GEOINFORMATICA
2010
15 years 2 months ago
2010
Abstract The modeling of a landscape environment is a cognitive activity that requires appropriate spatial representations. The research presented in this paper introduces a struct...
125
click to vote
JSS
2010
15 years 2 months ago
2010
The backbone of many software architectures and component integration frameworks is an architectural style that provides a domain-specific design vocabulary and a set of constrai...