Sciweavers

1648 search results - page 55 / 330
» On the generation of bicliques of a graph
Sort
View
RSA
2006
104views more  RSA 2006»
14 years 11 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
ICML
2010
IEEE
15 years 14 days ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
96
Voted
IM
2006
14 years 11 months ago
Using PageRank to Characterize Web Structure
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...
Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
KDD
2008
ACM
257views Data Mining» more  KDD 2008»
15 years 11 months ago
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
Issei Sato, Minoru Yoshida, Hiroshi Nakagawa
ATAL
2005
Springer
15 years 5 months ago
Model generation for PRS-like agents
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...
Wayne Wobcke, Marc Chee, Krystian Ji