654 search results - page 56 / 131 » Ordered Sets and Complete Lattices |
117
click to vote
CLIN
2001
15 years 1 months ago
2001
We describe a Named Entity Recognition system for Dutch that combines gazetteers, handcrafted rules, and machine learning on the basis of seed material. We used gazetteers and a c...
ENTCS
2000
14 years 11 months ago
2000
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
107
click to vote
NIPS
2003
15 years 1 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
124
click to vote
TKDE
2012
13 years 2 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
CALCO
2005
Springer
15 years 5 months ago
2005
Springer
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...