Sciweavers

1018 search results - page 22 / 204
» Generative unbinding of names
Sort
View
GIR
2006
ACM
14 years 1 months ago
Identifying and grounding descriptions of places
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 ...
Simon E. Overell, Stefan M. Rüger
CSL
2009
Springer
14 years 2 months ago
Nominal Domain Theory for Concurrency
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...
David Turner, Glynn Winskel
COLING
2002
13 years 7 months ago
A New Probabilistic Model for Title Generation
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...
Rong Jin, Alexander G. Hauptmann
CAP
2010
13 years 2 months 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, ...
ASIACRYPT
2009
Springer
14 years 2 months ago
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
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...
Mathias Herrmann, Alexander May