Sciweavers

5606 search results - page 88 / 1122
» Randomization Techniques for Graphs.
Sort
View
EMNLP
2008
13 years 10 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...
SODA
2008
ACM
59views Algorithms» more  SODA 2008»
13 years 10 months ago
Universality of random graphs
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...
SODA
2008
ACM
133views Algorithms» more  SODA 2008»
13 years 10 months ago
On the connectivity of dynamic random geometric graphs
Josep Díaz, Dieter Mitsche, Xavier Pé...
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
13 years 10 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...