Sciweavers

528 search results - page 1 / 106
» Degrees of categoricity of computable structures
Sort
View
63
Voted
AML
2010
104views more  AML 2010»
14 years 9 months ago
Degrees of categoricity of computable structures
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...
84
Voted
EUROCAST
2005
Springer
92views Hardware» more  EUROCAST 2005»
15 years 3 months ago
Computation of Partial Automata Through Span Composition
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
Karina Roggia, Marnes Hoff, Paulo Blauth Menezes
57
Voted
APAL
2002
77views more  APAL 2002»
14 years 9 months ago
Degree spectra and computable dimensions in algebraic structures
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richar...
SAC
2004
ACM
15 years 2 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
IJCV
2010
186views more  IJCV 2010»
14 years 8 months ago
An Approach to the Parameterization of Structure for Fast Categorization
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...
Christoph Rasche