1893 search results - page 69 / 379 » Computational composites |
161
Voted
ACL
2009
15 years 2 months ago
2009
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
170
click to vote
ACS
2011
14 years 11 months ago
2011
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
145
click to vote
COLING
2010
14 years 11 months ago
2010
This paper presents a framework for combining semantic relations extracted from text to reveal even more semantics that otherwise would be missed. A set of 26 relations is introdu...
126
Voted
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...
141
click to vote
JOC
2008
15 years 4 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...