Sciweavers

2887 search results - page 10 / 578
» Name Generation and Linearity
Sort
View
CAP
2010
15 years 10 days ago
Parallel computation of the minimal elements of a poset
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...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
GPCE
2004
Springer
15 years 10 months ago
A Fresh Calculus for Name Management
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 (...
Davide Ancona, Eugenio Moggi
COLING
2002
15 years 5 months ago
Unsupervised Named Entity Classification Models and their Ensembles
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...
Jae-Ho Kim, In-Ho Kang, Key-Sun Choi
162
Voted
AINA
2010
IEEE
15 years 10 months ago
Extracting Named Entities and Synonyms from Wikipedia
—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...
Christian Bohn, Kjetil Nørvåg
115
Voted
ENTCS
2007
86views more  ENTCS 2007»
15 years 5 months ago
Sequentiality and the CPS Semantics of Fresh Names
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 ...
James Laird