Sciweavers

3267 search results - page 123 / 654
» Generalized quasirandom graphs
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
(BP)2: Beyond pairwise Belief Propagation labeling by approximating Kikuchi free energies
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
Ifeoma Nwogu, Jason J. Corso
WWW
2007
ACM
15 years 12 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
15 years 11 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
AB
2008
Springer
15 years 5 months ago
Local Structure and Behavior of Boolean Bioregulatory Networks
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...
Heike Siebert
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 5 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...