8228 search results - page 86 / 1646 » Structural Logical Relations |
134
Voted
JIIS
2000
15 years 2 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
110
click to vote
ISCAPDCS
2003
15 years 3 months ago
2003
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
115
Voted
JSYML
2007
15 years 2 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
100
click to vote
ESWS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Relational databases are valuable sources for ontology learning. Methods and tools have been proposed to generate ontologies from such structured input. However, a major ...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...