17018 search results - page 3210 / 3404 » From the How to the What |
158
click to vote
SEMWEB
2007
Springer
16 years 19 days ago
2007
Springer
While lots of research in ontology matching is related to the issue of computing and refining similarity measures, only little attention has been paid to question how to extract t...
170
click to vote
STACS
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
162
click to vote
STACS
2007
Springer
16 years 19 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
158
click to vote
VMCAI
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
172
click to vote
WEBI
2007
Springer
16 years 18 days ago
2007
Springer
— We consider the problem of finding the relevant named entities in response to a search query over a given text corpus. Entity search can readily be used to augment conventiona...