4797 search results - page 152 / 960 » The complexity of partition tasks |
141
click to vote
EMNLP
2006
15 years 7 months ago
2006
Complex tasks like question answering need to be able to identify events in text and the relations among those events. We show that this event identification task and a related ta...
153
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
182
click to vote
ISAAC
2009
Springer
16 years 27 days ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
203
click to vote
SIAMCOMP
2011
15 years 1 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
176
click to vote
PACT
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...