1055 search results - page 68 / 211 » Enumerations in computable structure theory |
110
click to vote
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
MM
2003
ACM
15 years 3 months ago
2003
ACM
Although statistical characteristics of audio features are widely used for similarity measure in most of current audio analysis systems and have been proved to be effective, they ...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to...
ICCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...