2373 search results - page 125 / 475 » On the Theory of Structural Subtyping |
151
click to vote
SEMWEB
2007
Springer
16 years 20 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
205
click to vote
ECAI
2008
Springer
15 years 8 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, ...
171
click to vote
AR
2010
15 years 4 months ago
2010
Teams of autonomous space robots are needed for future space missions such as the construction of large solar power stations and large space telescopes in earth orbit. This work fo...
185
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
192
click to vote
COMPGEOM
2005
ACM
15 years 8 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...