Sciweavers

865 search results - page 79 / 173
» Random graph models for the web graph
Sort
View
147
Voted
ICDM
2010
IEEE
158views Data Mining» more  ICDM 2010»
15 years 1 months ago
Patterns on the Connected Components of Terabyte-Scale Graphs
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...
ICIP
2008
IEEE
15 years 10 months ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee
152
Voted
IJWMC
2010
115views more  IJWMC 2010»
15 years 1 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
129
Voted
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
15 years 9 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...
138
Voted
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 9 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner