Sciweavers

4009 search results - page 180 / 802
» Clustering on Complex Graphs
Sort
View
EJC
2008
15 years 4 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
ICWE
2005
Springer
15 years 9 months ago
Identifying Websites with Flow Simulation
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
Pierre Senellart
ICPR
2010
IEEE
15 years 2 months ago
NAVIDOMASS: Structural-based Approaches Towards Handling Historical Documents
In the context of the NAVIDOMASS project, the problematic of this paper concerns the clustering of historical document images. We propose a structural-based framework to handle the...
Salim Jouili, Mickaël Coustaty, Salvatore Tab...
124
Voted
ISBI
2008
IEEE
15 years 10 months ago
On the non-uniform complexity of brain connectivity
A stratification and manifold learning approach for analyzing High Angular Resolution Diffusion Imaging (HARDI) data is introduced in this paper. HARDI data provides highdimensio...
Gloria Haro, Christophe Lenglet, Guillermo Sapiro,...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 10 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan