50 search results - page 7 / 10 » Answering Opinion Questions with Random Walks on Graphs |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
KDD
2006
ACM
14 years 11 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
In a typical realistic scenario, there exist some past data about the structure of the network which are analyzed with respect to some possibly future spreading process, such as b...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
WWW
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...