5144 search results - page 857 / 1029 » Enhancing Search with Structure |
186
click to vote
AUSDM
2007
Springer
16 years 19 days ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
169
click to vote
CLEF
2007
Springer
16 years 19 days ago
2007
Springer
The domain-specific track uses test collections from the social science domain to test monolingual and cross-language retrieval in structured bibliographic databases. Special atte...
192
click to vote
CLEF
2007
Springer
16 years 19 days ago
2007
Springer
This paper accounts for Priberam's participation in the monolingual question answering (QA) track of CLEF 2007. In previous participations, Priberam’s QA system obtained en...
144
click to vote
CP
2007
Springer
16 years 19 days ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
173
click to vote
FSTTCS
2007
Springer
16 years 19 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...