2314 search results - page 81 / 463 » Monoids over domains |
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Mapping ontologies with high precision on the Semantic Web is a challenging problem that needs to be addressed in various domains. One of the main problems with any mapping process...
DAGSTUHL
2008
15 years 1 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
ICML
2004
IEEE
16 years 21 days ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
SAS
2010
Springer
14 years 10 months ago
2010
Springer
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
102
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Exploding amounts of multimedia data increasingly require automatic indexing and classification, e.g. training classifiers to produce high-level features, or semantic concepts, ch...