562 search results - page 59 / 113 » Ordered Sets in the Calculus of Data Structures |
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
106
click to vote
KDD
2012
ACM
13 years 6 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
100
click to vote
SSDBM
2006
IEEE
15 years 3 months ago
2006
IEEE
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
140
click to vote
ICANN
2001
Springer
15 years 2 months ago
2001
Springer
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...