50 search results - page 3 / 10 » Answering Opinion Questions with Random Walks on Graphs |
IJCAI
2007
13 years 11 months ago
2007
While traditional information extraction systems have been built to answer questions about facts, subjective information extraction systems will answer questions about feelings an...
STOC
1992
ACM
14 years 1 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
TALG
2010
13 years 4 months ago
2010
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
DM
2007
13 years 9 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...