Sciweavers

521 search results - page 24 / 105
» Coring method for clustering a graph
Sort
View
ICDAR
2009
IEEE
15 years 10 months ago
A Self-Adaptive Method for Extraction of Document-Specific Alphabets
Recognition and encoding of digitized historical documents is still a challenging and difficult task. A major problem is the occurrence of unknown glyphs and symbols which might n...
Stefan Pletschacher
ADHOC
2005
95views more  ADHOC 2005»
15 years 4 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen
RIVF
2003
15 years 5 months ago
Survey of Co-ordination of En Route Air Traffic Conflicts Resolution Modelling Methods
— The en-route conflict resolution remains a major concern for Air Traffic Management (ATM), especially in core European airspace where the current Air Traffic Control (ATC) syst...
Huy-Hoang Nguyen
UAI
2003
15 years 5 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 9 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...