1375 search results - page 12 / 275 » eg 2006 |
ICDCSW
2006
IEEE
14 years 2 months ago
2006
IEEE
— This paper proposes a new approach for handling overload in Publish/Subscribe systems. We focus on the fact that every service has to cope with the limitations imposed by the e...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Automatic systems are needed for audiovisual databases to efficiently index, browse, summarize and retrieve, because the amount of stored data is increasing tremendously. Historic...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...