197 search results - page 8 / 40 » Answering complex questions with random walk models |
101
click to vote
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n...
ISCAS
2007
IEEE
15 years 3 months ago
2007
IEEE
— This paper further investigates and answers two fundamental questions in the complex dynamical networks: i) how many nodes should a general complex dynamical network with fixe...
STOC
1991
ACM
15 years 28 days ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
104
click to vote
ADHOCNOW
2004
Springer
15 years 2 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
EMNLP
2006
14 years 10 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...