This paper presents a learning framework for blind source separation (BSS), in which the BSS is formulated as generalized Eigenvalue (GE) problem. Compared to the typical informati...
Automated methods for resource annotation are a clear necessity, as the success of the Semantic Web depends on the availability of Web resources with meta-data conforming to known...
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Current algorithms cannot be used optimally in (semi)automatic ontology matching tasks as envisioned by the Semantic Web community, mainly because of the inherent dependency betwee...
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...