1018 search results - page 22 / 204 » Generative unbinding of names |
140
click to vote
GIR
2006
ACM
15 years 12 months ago
2006
ACM
In this paper we test the hypothesis Given a piece of text describing an object or concept our combined disambiguation method can disambiguate whether it is a place and ground it ...
156
click to vote
CSL
2009
Springer
16 years 14 days ago
2009
Springer
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
154
click to vote
COLING
2002
15 years 5 months ago
2002
Title generation is a complex task involving both natural language understanding and natural language synthesis. In this paper, we propose a new probabilistic model for title gene...
163
click to vote
CAP
2010
15 years 28 days 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...
170
click to vote
ASIACRYPT
2009
Springer
16 years 15 days ago
2009
Springer
We look at iterated power generators si = se i−1 mod N for a random seed s0 ∈ ZN that in each iteration output a certain amount of bits. We show that heuristically an output of...