2004 search results - page 149 / 401 » Sampling from large graphs |
152
click to vote
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...
108
click to vote
ICCAD
2007
IEEE
16 years 5 days ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
93
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— This paper presents an oceanographic toolchain that can be used to generate multi-vehicle robotic surveys for large-scale dynamic features in the coastal ocean. Our science app...
185
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
115
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...