528 search results - page 16 / 106 » Degrees of categoricity of computable structures |
ISCC
2002
IEEE
14 years 1 months ago
2002
IEEE
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
ICVGIP
2004
13 years 10 months ago
2004
This paper presents several results on images of various configurations of conics. We extract information about the plane from single and multiple views of known and unknown conic...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
CIE
2009
Springer
14 years 16 days ago
2009
Springer
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
CVPR
1997
IEEE
14 years 24 days ago
1997
IEEE
In this paper we focus on using local 3D structure for segmentation. A tensor descriptor is estimated for each neighbourhood, i.e. for each voxel in the data set. The tensors are ...