1918 search results - page 167 / 384 » Discovering Cortical Algorithms |
141
click to vote
WEBI
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a Domain Modeling System, which builds a domain model framework for adaptive Web systems. It records concepts and the relationships among them and represents t...
128
click to vote
AIMSA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The problem of finding an agreement on the meaning of heterogeneous schemas is one of the key issues in the development of the Semantic Web. In this paper, we propose a ...
191
click to vote
PKDD
2004
Springer
15 years 10 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
138
click to vote
ICDM
2002
IEEE
15 years 10 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
156
click to vote
IDEAS
2002
IEEE
15 years 9 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...