2887 search results - page 10 / 578 » Name Generation and Linearity |
CAP
2010
14 years 6 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
71
Voted
GPCE
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (...
77
Voted
COLING
2002
14 years 11 months ago
2002
This paper proposes an unsupervised learning model for classifying named entities. This model uses a training set, built automatically by means of a small-scale named entity dicti...
110
click to vote
AINA
2010
IEEE
15 years 4 months ago
2010
IEEE
—In many search domains, both contents and searches are frequently tied to named entities such as a person, a company or similar. An example of such a domain is a news archive. O...
ENTCS
2007
14 years 11 months ago
2007
We investigate the domain-theoretic denotational semantics of a CPS with fresh name declaration. This is the target of a fully abstract CPS translation from the nu-calculus with ...