Sciweavers

598 search results - page 17 / 120
» A random graph model for massive graphs
Sort
View
AIRS
2006
Springer
14 years 2 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
RECOMB
2004
Springer
14 years 11 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
ENDM
2006
70views more  ENDM 2006»
13 years 11 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
ACL
2009
13 years 8 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
SIGCOMM
2009
ACM
14 years 5 months ago
Tuning message size in opportunistic mobile networks
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
John Whitbeck, Vania Conan, Marcelo Dias de Amorim