50 search results - page 10 / 10 » Answering Opinion Questions with Random Walks on Graphs |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
DIALM
2003
ACM
14 years 20 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
CONSTRAINTS
1998
13 years 7 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...