Sciweavers

2842 search results - page 56 / 569
» Expansion and Search in Networks
Sort
View
132
Voted
UAI
1996
15 years 3 months ago
Efficient Search-Based Inference for noisy-OR Belief Networks: TopEpsilon
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...
Kurt Huang, Max Henrion
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 6 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
GLOBECOM
2009
IEEE
15 years 5 months ago
Power Efficient Traffic Grooming in Optical WDM Networks
Abstract--Power-awareness in networking attracts more attention as the trends in the energy consumption of the Internet raise growing concerns about the environmental impacts and s...
Emre Yetginer, George N. Rouskas
ICALP
2009
Springer
15 years 8 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
ICCSA
2004
Springer
15 years 7 months ago
Searching for 2D Spatial Network Holes
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
Femke Reitsma, Shane Engel