Sciweavers

2310 search results - page 305 / 462
» Coloring Random Graphs
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 2 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
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
CLEF
2010
Springer
13 years 9 months ago
Using Web Graph Structure for Person Name Disambiguation
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
Elena Smirnova, Konstantin Avrachenkov, Brigitte T...
CN
2008
108views more  CN 2008»
13 years 8 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
MICCAI
2010
Springer
13 years 6 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...